On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm

DOI10.1109/TIT.2006.885458MaRDI QIDQ3547981zbMATH OpenFDO

Authors Luis A. Lastras-Montaño

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Recommendations

• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
• On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
• On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
• Improved redundancy of a version of the Lempel-Ziv algorithm
• Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm

Cited in

(2)

• On optimal parsing for LZ78-like compressors
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm

This page was built for publication: On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm

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