Title :
Improved redundancy of a version of the Lempel-Ziv algorithm
Author :
Wyner, Aaron D. ; Wyner, Abraham J.
Author_Institution :
AT&T Bell Labs., Murray Hill, NJ, USA
fDate :
5/1/1995 12:00:00 AM
Abstract :
The Lempel-Ziv data compression algorithm has the property that for finite-memory sources the redundancy ρn (defined as the difference between the average code rate and the entropy when the memory size is n) is O (log log n/log n). We suggest a new version of the algorithm with redundancy ρn=O (1/log n)
Keywords :
data compression; entropy; source coding; Lempel-Ziv algorithm; average code rate; data compression algorithm; entropy; finite-memory sources; memory size; redundancy; source coding; Data compression; Decoding; Encoding; Entropy; Helium; Information theory; Statistics; Zirconium;
Journal_Title :
Information Theory, IEEE Transactions on
