Advertisement

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. 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
  2. Storer, J. A. and T. G. Szymanski (1982) “Data Compression via Textual Substitution,” Journal of the ACM 29:928–951.MathSciNetMATHCrossRefGoogle Scholar
  3. Cachin, Christian (1998) “An Information-Theoretic Model for Steganography,” in Proceedings of the Second International Workshop on Information Hiding, D. Aucsmith, ed. vol. 1525 of Lecture Notes in Computer Science, Springer-Verlag, pp. 306–318.CrossRefGoogle Scholar
  4. Willems, F. M. J. (1989) “Universal Data Compression and Repetition Times,” IEEE Transactions on Information Theory, IT-35(l):54–58, January.MathSciNetMATHCrossRefGoogle Scholar
  5. 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
  6. Fiala, E. R., and D. H. Greene (1989), “Data Compression with Finite Windows,” Communications of the ACM 32(4):490–505.CrossRefGoogle Scholar
  7. Phillips, Dwayne (1992) “LZW Data Compression,” The Computer Application Journal Circuit Cellar Inc., 27:36–48, June/July.Google Scholar
  8. Welch, T. A. (1984) “A Technique for High-Performance Data Compression,” IEEE Computer 17(6):8–19, June.CrossRefGoogle Scholar
  9. 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
  10. 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
  11. Yokoo, Hidetoshi (1991) “An Improvement of Dynamic Huffman Coding with a Simple Repetition Finder,” IEEE Transactions on Communications 39(l):8–10, January.CrossRefGoogle Scholar
  12. 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
  13. 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
  14. Murray, James D. and William van Ryper, (1994) Encyclopedia of Graphics File Formats, Sebastopol, CA, O’Reilly and Assoc.Google Scholar
  15. Thomborson, Clark (1992) “The V.42bis Standard for Data-Compressing Modems,” IEEE Micro pp. 41–53, October.Google Scholar
  16. Ramabadran, Tenkasi V., and Sunil S. Gaitonde (1988) “A Tutorial on CRC Computations,” IEEE Micro pp. 62–75, August.Google Scholar
  17. Crocker, Lee Daniel (1995) “PNG: The Portable Network Graphic Format,” Dr. Dobb’s Journal of Software Tools 20(7):36–44.Google Scholar
  18. Rodriguez, Karen (1995) “Graphics File Format Patent Unisys Seeks Royalties from GIF Developers,” InfoWorld, January 9, 17(2):3.Google Scholar
  19. Zalta, Edward N. (1988) “Are Algorithms Patentable?” Notices of the American Mathematical Society, 35(6):796–799.Google Scholar
  20. 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.MATHCrossRefGoogle Scholar
  21. 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-Verlag New York, Inc. 2000

Authors and Affiliations

  • David Salomon
    • 1
  1. 1.Department of Computer ScienceCalifornia State University, NorthridgeNorthridgeUSA

Personalised recommendations