Improvement of the Lempel-Ziv data compression algorithm based on the counting interpretation

Meir Feder, Baruch Nissenbaum

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The interpretation of the Lempel-Ziv data compression algorithm as an implicit method for estimating the probability of the next outcome in the sequence given the past observations was utilized for gambling purposes and provides an insight why the algorithm works. However, the explicit interpretation also suggests an improved probability estimation method which leads to a better data compression algorithm. The modified algorithm is decscribed and its improved performance is shown.

Original languageEnglish
Title of host publicationProceedings - 1991 IEEE International Symposium on Information Theory, ISIT 1991
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages113
Number of pages1
ISBN (Electronic)0780300564
DOIs
StatePublished - 1991
Event1991 IEEE International Symposium on Information Theory, ISIT 1991 - Budapest, Hungary
Duration: 24 Jun 199128 Jun 1991

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Conference

Conference1991 IEEE International Symposium on Information Theory, ISIT 1991
Country/TerritoryHungary
CityBudapest
Period24/06/9128/06/91

Fingerprint

Dive into the research topics of 'Improvement of the Lempel-Ziv data compression algorithm based on the counting interpretation'. Together they form a unique fingerprint.

Cite this