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

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 135; no. 1; pp. 245 - 254
Main Author: Potapov, V.N.
Format: Journal Article
Language:English
Published: Elsevier B.V 15.01.2004
Subjects:
Data compression
Lempel–Ziv algorithm
Data compression
Lempel–Ziv algorithm
ISSN:0166-218X, 1872-6771
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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