Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources

DOI10.1109/18.212306zbMATH Open0776.94003OpenAlexW2117900277MaRDI QIDQ4202102FDOQ4202102

Authors: Tsutomu Kawabata 

Publication date: 5 December 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.212306

Recommendations

• Average profile of the Lempel-Ziv parsing scheme for a Markovian source
• Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
• Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm

zbMATH Keywords

probability generating functionfirst passage timefunctional equationsource codingLempel-Ziv algorithm

Mathematics Subject Classification ID

Source coding (94A29)

Cited In (7)

• Entropy and data compression schemes
• An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
• On the AEP of word-valued sources
• Title not available (Why is that?)
• Formulae to calculate distributions of the Lempel-Ziv statistics and related statistics
• Entropy and distinct parsing for ergodic sources
• Universal coding of nonstationary sources

This page was built for publication: Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202102)