DocumentCode
2053707
Title
Asymptotical optimality of two variations of Lempel-Ziv codes for sources with countably infinite alphabet
Author
Uyematsu, Tomohiko ; Kanaya, Fumio
Author_Institution
Tokyo Inst. of Technol., Japan
fYear
2002
fDate
2002
Firstpage
122
Abstract
This paper considers the problem of universally coding stationary ergodic sources with countably infinite alphabet. Especially, we show a sufficient condition for both of Lempel-Ziv ´78 and ´77 (LZ78 and LZ77) coding algorithms to achieve asymptotically the entropy rate of those sources.
Keywords
data compression; entropy; source coding; Lempel-Ziv codes; asymptotical optimality; countably infinite alphabet; entropy rate; stationary ergodic sources; Code standards; Data compression; Decoding; Entropy; Information theory; Sufficient conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN
0-7803-7501-7
Type
conf
DOI
10.1109/ISIT.2002.1023394
Filename
1023394
Link To Document