Cascading LZW algorithm with huffman coding: A variable to variable length compression algorithm

  • Yehoshua Perl
  • Ashish Mehta
Track 4: Algorithms
Part of the Lecture Notes in Computer Science book series (LNCS, volume 507)


Two common schemes in data compression are fixed to variable length coding and variable to fixed length coding. Higher compression is expected from the more flexible scheme of variable to variable length coding. In such a scheme a compression dictionary is used to transfer variable length strings over the text alphabet into variable length strings over the coding alphabet. The compression is achieved due to matching longer more frequent text strings with shorter coding strings.

To obtain a variable to variable length coding we choose to cascade the LZW, variable to fixed, coding with the Huffman, fixed to variable, coding. In this work we consider the effective way of performing this cascading, to optimize the compression using limited time resources.


Compression Ratio Compression Algorithm Length Code Code Word 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CFP]
    Y. Choueka, A.S. Fraenkel, Y. Perl.: Polynomial construction of optimal prefix tables for text compression. Proc. 19th Annual Allerton Conferences on Communication, control and Computing, 1981, 762–768.Google Scholar
  2. [FMP]
    A. S. Fraenkel, M. Mor, Y. Perl.: Is text compression by prefixes and suffixes practical? Acta Informatica 20, 1983, 371–389.MathSciNetCrossRefGoogle Scholar
  3. [H]
    D.A. Huffman.: A method for the construction of minimum redundancy codes. [A In Proc. IRE 40 (1951). 1098–1101.Google Scholar
  4. [L]
    M.F. Lynch.: Compression of bibliographic files using an adoption of run-length coding. Infor. Stor. Retr. 9, 1973, 207–214.CrossRefGoogle Scholar
  5. [PCM]
    Y. Perl, S. Chatterjee, T. Mahapatra.: Incorporating updates into the LZW compression algorithm. N.J.I.T. Technical report.Google Scholar
  6. [PGS]
    Y. Perl, S. Gupta, A. Shrivastava, Towards a bound for the compression of the LZW algorithm. N.J.I.T. Technical report.Google Scholar
  7. [SS1]
    J.A.Storer, T.G. Szymanski.:The macro model for data compression. Extended Abstract. Proc. Tenth Annual ACM symposium on theory of computing, San Diego, CA, 1978, 30–39.Google Scholar
  8. [SS2]
    J.A. Storer, T.G. Szymanski.: Data compression via textual substitution. JACM 29, 1982, 928–951.zbMATHMathSciNetCrossRefGoogle Scholar
  9. [SS3]
    M.E.G. Smith, J.A. Storer.: Parallel Algorithms Data Compression, JACM, Vol. 32 No. 2, April 1985.Google Scholar
  10. [W]
    T.A. Welch.: A technique for high performance data compression, IEEE Computer Journal, 1984, 8–19.Google Scholar
  11. [ZL1]
    J. Ziv, A. Lempel.: A universal algorithm for sequencial data compression. IEEE Trans. on Info. theory, Vol.IT-23, 1977, 337–343.MathSciNetCrossRefGoogle Scholar
  12. [ZL2]
    J. Ziv, A. Lempel.: Compression of individual sequences via variable-rate coding.: IEEE Trans. on Info. Theory, Vol.IT, 1978, 530–536.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Yehoshua Perl
    • 1
  • Ashish Mehta
    • 1
  1. 1.Institute of Integrated Systems, Department of Computer ScienceNew Jersey Institute of TechnologyNewark

Personalised recommendations