Skip to main content

Statistical Methods

  • Chapter
Data Compression
  • 175 Accesses

Abstract

The different RLE variants have one common feature, they assign fixed-size codes to the symbols (characters or pixels) they operate on. In contrast, statistical meth¬ods use variable-size codes, with the shorter codes assigned to symbols or groups of symbols that appear more often in the data (have a higher probability of occur¬rence). Samuel Morse used this property when he designed his well-known telegraph code (Table 2.1). The two main problems with variable-size codes are (1) assign¬ing codes that can be decoded unambiguously and (2) assigning codes with the minimum average size.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • Huffman, David (1952) “A Method for the Construction of Minimum Redundancy Codes,” Proceedings of the IRE 40(9): 1098–1101.

    Article  Google Scholar 

  • Hirschberg, D., and D. Lelewer (1990) “Efficient Decoding of Prefix Codes” Communications of the ACM 33(4):449–459.

    Article  Google Scholar 

  • Sieminski, A. (1988) “Fast Decoding of the Huffman Codes,” Information Processing Letters 26(5):237–241.

    Article  Google Scholar 

  • Knuth, D. E. (1985) “Dynamic Huffman Coding,” Journal of Algorithms 6:163–180.

    Article  MathSciNet  MATH  Google Scholar 

  • Vitter, Jeffrey S. (1987) “Design and Analysis of Dynamic Huffman Codes,” Journal of the ACM 34(4):825–845, October.

    Article  MathSciNet  MATH  Google Scholar 

  • Gottlieb, D., et al (1975) A Classification of Compression Methods and their Usefulness for a Large Data Processing Center, Procedings of National Computer Conference 44:453–458.

    Google Scholar 

  • Nix, R. (1981) “Experience With a Space Efficient Way to Store a Dictionary,” Communications of the ACM 24(5):297–298.

    Article  Google Scholar 

  • Robinson, P., and D. Singer (1981) “Another Spelling Correction Program,” Communications of the ACM 24(5):296–297.

    Article  Google Scholar 

  • Young, D. M. (1985) “MacWrite File Format,” Wheels for the Mind 1:34, Fall.

    Google Scholar 

  • Cleary, J. G. and I. H. Witten (1984) “Data Compression Using Adaptive Coding and Partial String Matching,” IEEE Transactions on Communications COM-32(4):396–402, April.

    Article  Google Scholar 

  • Moffat, A. (1990) “Implementing the PPM Data Compression Scheme,” IEEE Transactions on Communications COM-38(11):1917–1921, November.

    Article  Google Scholar 

  • Wright, E. V. (1939) Gadsby, Los Angeles, Wetzel. Reprinted by University Microfilms, Ann Arbor, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer Science+Business Media New York

About this chapter

Cite this chapter

Salomon, D. (1998). Statistical Methods. In: Data Compression. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-2939-9_2

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2939-9_2

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-98280-9

  • Online ISBN: 978-1-4757-2939-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics