Abstract
In this work, the concept of conditional Lempe-Ziv encoder is presented. This concept is used to establish a variant of the Lempel-Ziv-Welch encoder (LZW). The practical performance of the new version is measured by using the Canterbury Corpus and it is compared to the performance of the LZW. The new version has shown an improvement around 10% over the LZW, when compressing the Canterbury Corpus.
Highlights
In 1976 Lempel and Ziv proposed a complexity measure for finite sequences based on the string matching technique [I]
The results presented in that work showed that the string matching technique could be very useful to design univer sal source encoders
In [l6] the problem of establishing a good test set for a lossless encoder is discussed and a new test set is introduced. This new test set, called Canterbury Corpus, became popu lar and it has been used to measure the practical performance of many lossless encoders
Summary
In 1976 Lempel and Ziv proposed a complexity measure for finite sequences based on the string matching technique [I]. The results presented in that work showed that the string matching technique could be very useful to design univer sal source encoders. Ziv and Lem pel introduced two encoders. The practical importance of these encoders is due mainly to the relationship of their low complexity and good performance. Many variants were proposed, some of them widely used in practice [4] Following those works. many variants were proposed, some of them widely used in practice [4]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.