Keyword : countably infinite alphabet


Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet
Tomohiko UYEMATSU Fumio KANAYA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/10/01
Vol. E89-A  No. 10 ; pp. 2459-2465
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Source Coding
Keyword: 
countably infinite alphabetergodic sourceincremental parsingLempel-Ziv codestring matching
 Summary | Full Text:PDF