Statistical Methods

  • David Salomon

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.

Keywords

Input Stream Output Stream Arithmetic Code Huffman Code Short Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Huffman, David (1952) “A Method for the Construction of Minimum Redundancy Codes,” Proceedings of the IRE 40(9): 1098–1101.CrossRefGoogle Scholar
  2. Hirschberg, D., and D. Lelewer (1990) “Efficient Decoding of Prefix Codes” Communications of the ACM 33(4):449–459.CrossRefGoogle Scholar
  3. Sieminski, A. (1988) “Fast Decoding of the Huffman Codes,” Information Processing Letters 26(5):237–241.CrossRefGoogle Scholar
  4. Knuth, D. E. (1985) “Dynamic Huffman Coding,” Journal of Algorithms 6:163–180.MathSciNetMATHCrossRefGoogle Scholar
  5. Vitter, Jeffrey S. (1987) “Design and Analysis of Dynamic Huffman Codes,” Journal of the ACM 34(4):825–845, October.MathSciNetMATHCrossRefGoogle Scholar
  6. 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
  7. Nix, R. (1981) “Experience With a Space Efficient Way to Store a Dictionary,” Communications of the ACM 24(5):297–298.CrossRefGoogle Scholar
  8. Robinson, P., and D. Singer (1981) “Another Spelling Correction Program,” Communications of the ACM 24(5):296–297.CrossRefGoogle Scholar
  9. Young, D. M. (1985) “MacWrite File Format,” Wheels for the Mind 1:34, Fall.Google Scholar
  10. 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.CrossRefGoogle Scholar
  11. Moffat, A. (1990) “Implementing the PPM Data Compression Scheme,” IEEE Transactions on Communications COM-38(11):1917–1921, November.CrossRefGoogle Scholar
  12. Wright, E. V. (1939) Gadsby, Los Angeles, Wetzel. Reprinted by University Microfilms, Ann Arbor, 1991.Google Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • David Salomon
    • 1
  1. 1.Department of Computer ScienceCalifornia State UniversityNorthridgeUSA

Personalised recommendations