A Note on a Sequence Related to the Lempel-Ziv Parsing

Tsutomu KAWABATA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E83-A   No.10   pp.1979-1982
Publication Date: 2000/10/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 and Data Compression
Keyword: 
source coding,  data compression,  Lempel-Ziv incremental parsing,  binomial coefficients,  

Full Text: PDF>>
Buy this Article




Summary: 
The expected lengths of the parsed segments obtained by applying Lempel-Ziv incremental parsing algorithm for i.i.d. source satisfy simple recurrence relations. By extracting a combinatorial essence from the previous proof, we obtain a simpler derivation.