Asymptotical Optimality of Two Variations of Lempel-Ziv Codes for Sources with Countably Infinite Alphabet Tomohiko UYEMATSUFumio KANAYA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/10/01 Vol. E89-ANo. 10 ;
pp. 2459-2465 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Source Coding Keyword: countably infinite alphabet, ergodic source, incremental parsing, Lempel-Ziv code, string matching,
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/06/01 Vol. E87-ANo. 6 ;
pp. 1651-1654 Type of Manuscript: LETTER Category: Information Theory Keyword: secret key-capacity, common randomness, ergodic source,