Redundancy estimates for the Lempel-Ziv algorithm of data compression

Authors:
V. N. Potapov
Affiliations:
Sobolev Institute of Mathematics, SB RAS, pr. Ak. Koptyuga 4, 630090 Novosibirsk, Russia
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 7
Cited 1

Data compression via textual substitution

Journal of the ACM (JACM)
Universal Compression and Retrieval

Universal Compression and Retrieval
On the average redundancy rate of the Lempel-Ziv code

IEEE Transactions on Information Theory
Redundancy of the Lempel-Ziv incremental parsing rule

IEEE Transactions on Information Theory
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm

IEEE Transactions on Information Theory
Redundancy of the Lempel-Ziv string matching code

IEEE Transactions on Information Theory
Improved redundancy of a version of the Lempel-Ziv algorithm

IEEE Transactions on Information Theory

Superior Guarantees for Sequential Prediction and Lossless Compression via Alphabet Decomposition

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.04

Visualization

Abstract

The problem of non-distorting compression (or coding) of sequences of symbols is considered. For sequences of asymptotically zero empirical entropy, a modification of the Lempel-Ziv coding rule is offered whose coding cost is at most a finite number of times worse than the optimum. A combinatorial proof is offered for the well-known redundancy estimate of the Lempel-Ziv coding algorithm for sequences having a positive entropy.