Almost Sure Optimality of Sliding Window Lempel–Ziv Algorithm and Variants Revisited

DOI10.1109/TIT.2013.2259291MaRDI QIDQ5346423zbMATH OpenOpenAlexFDO

Authors Tony Jacob, Rakesh K. Bansal

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Dynamical aspects of measure-preserving transformations (37A05) Information theory (general) (94A15) Source coding (94A29)

Cited in

(3)

• On optimal parsing for LZ78-like compressors
• On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
• An alternative algorithm for a sliding window ULV decomposition

This page was built for publication: Almost Sure Optimality of Sliding Window Lempel–Ziv Algorithm and Variants Revisited

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