Document Type
Thesis
Date of Award
5-31-1989
Degree Name
Master of Science in Computer Science - (M.S.)
Department
Computer and Information Science
First Advisor
Yehoshua Perl
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 string 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 resourses.
Recommended Citation
Mehta, Ashish Khandubhai, "Cascading LZW algorithm with Huffman coding : a variable to variable length compression algorithm" (1989). Theses. 2851.
https://digitalcommons.njit.edu/theses/2851
