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

Yehoshua Perl, Ashish Mehta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationComputing in the 1990's - 1st Great Lakes Computer Science Conference, Proceedings
EditorsNaveed A. Sherwani, Elise de Doncker, John A. Kapenga
PublisherSpringer Verlag
Pages170-178
Number of pages9
ISBN (Print)9780387976280
DOIs
StatePublished - Jan 1 1991
Event1st Great Lakes Computer Science Conference, 1989 - Kalamazoo, United States
Duration: Oct 18 1989Oct 20 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume507 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st Great Lakes Computer Science Conference, 1989
CountryUnited States
CityKalamazoo
Period10/18/8910/20/89

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Cascading LZW algorithm with huffman coding: A variable to variable length compression algorithm'. Together they form a unique fingerprint.

Cite this