Title :
Enhancing Lempel-Ziv codes using an on-line variable length binary encoding
Author :
Acharya, Tinku ; JáJá, Joseph F.
Author_Institution :
Inst. for Adv. Comput. Studies, Maryland Univ., College Park, MD, USA
Abstract :
Summary form only given. The LZW algorithm is the most popular dictionary-based adaptive text compression scheme [Welch 1984]. In the LZW algorithm, a changing dictionary contains common strings that have been encountered so far in the text. The motivation for the present research is to explore an on-line variable-length binary encoding. We apply this encoding to LZW codes for remedy of the problem that we discussed in Acharya and Mukherjee [1995]. We call it the LZWAJ algorithm
Keywords :
data compression; variable length codes; LZW Algorithm; LZWAJ algorithm; Lempel-Ziv codes; dictionary-based adaptive text compression scheme; on-line variable length binary encoding; strings; Binary codes; Binary trees; Data compression; Dictionaries; Educational institutions; Encoding; Logic; Software testing; Tree data structures; Upper bound;
Conference_Titel :
Data Compression Conference, 1996. DCC '96. Proceedings
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-7358-3
DOI :
10.1109/DCC.1996.488347
