Dictionary Methods

  • David Salomon

Abstract

Statistical compression methods use a statistical model of the data, and the quality of compression they achieve depends on how good that model is. Dictionary-based compression methods do not use a statistical model, nor do they use variable-size codes. Instead they select strings of symbols and encode each string as a token using a dictionary. The dictionary holds strings of symbols and it may be static or dynamic (adaptive). The former is permanent, sometimes allowing the addition of strings but no deletions, whereas the latter holds strings previously found in the input stream, allowing for additions and deletions of strings as new input is being read.

Keywords

Input Stream Index Table Output Stream Binary Search Tree Huffman 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. Storer, J. A. and T. G. Szymanski (1982) “Data Compression via Textual Substitution,” Journal of the ACM 29:928–951.MathSciNetMATHCrossRefGoogle Scholar
  2. Ziv, J. and A. Lempel (1978) “Compression of Individual Sequences via Variable-Rate Coding,” IEEE Transactions on Information Theory IT-24(5):530–536.MathSciNetMATHCrossRefGoogle Scholar
  3. Fiala, E. R., and D. H. Greene (1989), “Data Compression with Finite Windows,” Communications of the ACM 32(4):490–505.CrossRefGoogle Scholar
  4. Ziv, J. and A. Lempel (1977) “A Universal Algorithm for Sequential Data Compression,” IEEE Transactions on Information Theory IT-23(3):337–343.MathSciNetMATHCrossRefGoogle Scholar
  5. Storer, J. A. and T. G. Szymanski (1982) “Data Compression via Textual Substitution,” Journal of the ACM 29:928–951.MathSciNetMATHCrossRefGoogle Scholar
  6. Williams, Ross (1991),”An Extremely Fast Ziv-Lempel Data Compression Algorithm,” in Proceedings of the 1991 Data Compression Conference, J. Storer ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 362–371.Google Scholar
  7. Williams, Ross N., Adaptive Data Compression, Boston, Kluwer Academic Publishers, 1991.MATHCrossRefGoogle Scholar
  8. Miller, V. S., and M. N. Wegman (1985) “Variations On a Theme by Ziv and Lempel,” in A. Apostolico and Z. Galil, eds., NATO ASI series Vol. F12, Combinatorial Algorithms on Words, Springer, Berlin, pp. 131–140.Google Scholar
  9. Bloom, C. R. (1996), “LZP: A New Data Compression Algorithm,” in Proceedings of Data Compression Conference, J. Storer, editor, Los Alamitos, CA, IEEE Computer Society Press, p. 425.Google Scholar
  10. Yokko, Hidetoshi (1991) “An Improvement of Dynamic Huffman Coding with a Simple Repetition Finder,” IEEE Transactions on Communications 39(1):8–10, January.CrossRefGoogle Scholar
  11. Horspool, N. R. (1991) “Improving LZW,” in Proceedings of the 1991 Data Compression Conference, J. Storer Ed., Los Alamitos, CA, IEEE Computer Society Press, pp .332–341.Google Scholar
  12. Blackstock, Steve (1987) “LZW and GIF Explained,” public domain, available from URL “http ://www.ece.uiuc.edu/~ece291/class-resources/gpe/gif.txt.html“.Google Scholar
  13. Murray, James D. and William vanRyper, (1994) Encyclopedia of Graphics File Formats: O’Reilly and Assoc.Google Scholar
  14. Thomborson, Clark (1992) “The V.42bis Standard for Data-Compressing Modems,” IEEE Micro pp. 41–53, October.Google Scholar
  15. Langdon, Glen G. (1983) “A Note on the Ziv-Lempel Model for Compressing Individual Sequences,” IEEE Transactions on Information Theory IT-29(2):284–287, March.Google Scholar
  16. Langdon, Glen G. (1984) On Parsing vs. Mixed-Order Model Structures for Data Compression, IBM research report RJ-4163 (46091), Jan 18, 1984, San Jose.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