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
The LZW algorithm is a well known efficient adaptive compression algorithm. It is based on constructing a dictionary containing character strings from the text. A number of researchers have attempted to add variations to the original algorithm to achieve higher compression values. In this thesis we attempt to find a bound for the LZW approach. That is, we build a dictionary which gives maximum compression and satisfies prefix property of LZW algorithm.
In order to build such an optimum dictionary, the dynamic programming technique is applied. The final dictionary selected consists of entries which give maximum overall compression and also satisfy the prefix property of LZW algorithm. Numerous experiments were performed using different text representation to obtain high compression values. The compression values obtained are substantially higher than the ones obtained by LZW approach. This indicates that significantly higher compression can be obtained with improvements in LZW approach, which can direct our future efforts.
Recommended Citation
Srivastava, Anoop Kumar, "Towards a bound for the compression of the LZW algorithm" (1989). Theses. 2897.
https://digitalcommons.njit.edu/theses/2897
