Redundancy estimates for the Lempel–Ziv algorithm of data compression

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 p...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics Jg. 135; H. 1; S. 245 - 254
1. Verfasser: Potapov, V.N.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 15.01.2004
Schlagworte:
Data compression
Lempel–Ziv algorithm
Data compression
Lempel–Ziv algorithm
ISSN:0166-218X, 1872-6771
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(02)00308-6