DocumentCode
773061
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
Volume
41
Issue
3
fYear
1995
fDate
5/1/1995 12:00:00 AM
Firstpage
723
Lastpage
731
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;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.382018
Filename
382018
Link To Document