Skip to main content
Springer Nature Link
Log in

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

  • Track 4: Algorithms
  • Conference paper
  • First Online:
Computing in the 90's (Great Lakes CS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 507))

Included in the following conference series:

  • 193 Accesses

Abstract

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.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. A. S. Fraenkel, M. Mor, Y. Perl.: Is text compression by prefixes and suffixes practical? Acta Informatica 20, 1983, 371–389.

    Article  MathSciNet  Google Scholar 

  3. D.A. Huffman.: A method for the construction of minimum redundancy codes. [A In Proc. IRE 40 (1951). 1098–1101.

    Google Scholar 

  4. M.F. Lynch.: Compression of bibliographic files using an adoption of run-length coding. Infor. Stor. Retr. 9, 1973, 207–214.

    Article  Google Scholar 

  5. Y. Perl, S. Chatterjee, T. Mahapatra.: Incorporating updates into the LZW compression algorithm. N.J.I.T. Technical report.

    Google Scholar 

  6. 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. 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. J.A. Storer, T.G. Szymanski.: Data compression via textual substitution. JACM 29, 1982, 928–951.

    Article  MATH  MathSciNet  Google Scholar 

  9. M.E.G. Smith, J.A. Storer.: Parallel Algorithms Data Compression, JACM, Vol. 32 No. 2, April 1985.

    Google Scholar 

  10. T.A. Welch.: A technique for high performance data compression, IEEE Computer Journal, 1984, 8–19.

    Google Scholar 

  11. J. Ziv, A. Lempel.: A universal algorithm for sequencial data compression. IEEE Trans. on Info. theory, Vol.IT-23, 1977, 337–343.

    Article  MathSciNet  Google Scholar 

  12. J. Ziv, A. Lempel.: Compression of individual sequences via variable-rate coding.: IEEE Trans. on Info. Theory, Vol.IT, 1978, 530–536.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Integrated Systems, Department of Computer Science, New Jersey Institute of Technology, 07102, Newark, NJ

    Yehoshua Perl & Ashish Mehta

Authors
  1. Yehoshua Perl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ashish Mehta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perl, Y., Mehta, A. (1991). Cascading LZW algorithm with huffman coding: A variable to variable length compression algorithm. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038489

Download citation

  • DOI: https://doi.org/10.1007/BFb0038489

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation