A note on performance improvement of Ziv‐Lempel code
Koutarou Ise, Hatsukazu Tanaka · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 1993
Abstract The Ziv‐Lempel (ZL) algorithm is well known as an efficient universal source coding algorithm to encode a data string by replacing with codewords given by substrings in a fixed‐size buffer. However, the original ZL algorithm contains considerable redundancy on how to give a codeword for each substring because the same substring appears in some different places in the buffer. In this paper, a new algorithm to remove such redundancy is proposed to improve the coding efficiency for any kinds of strings. The algorithm requires search matched strings in the decoding process. A modified algorithm also is proposed to decode without searching matched strings.