A Note on Lempel-Ziv-Yokoo Algorithm

Junya KIYOHARA  Tsutomu KAWABATA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E79-A   No.9   pp.1460-1463
Publication Date: 1996/09/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Source Coding
Keyword: 
source coding,  data compression,  Lempel-Ziv algorithm,  asymptotic optimality,  

Full Text: PDF(186.5KB)>>
Buy this Article




Summary: 
We study Lempel-Ziv-Yokoo algorithm [1, Algorithm 4] for universal data compression. In this paper, we give a simpler implementation of Lempel-Ziv-Yokoo algorithm than the original one [1, Algorithm 4] and show its asymptotic optimality for a stationary ergodic source.