On asymptotic optimality of a sliding window variation of Lempel-Ziv codes

DOI10.1109/18.265494MaRDI QIDQ4307463zbMATHOpenAlexFDO

Authors Hiroyoshi Morita, Kingo Kobayashi

Publication date 27 September 1994

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

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

zbMATH Keywords

asymptotic optimalityLempel-Ziv algorithmsliding windowuniversal data compressionfinite-state sources

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Efficient error-correcting codes for sliding windows
• Efficient Error-Correcting Codes for Sliding Windows
• Almost Sure Optimality of Sliding Window Lempel–Ziv Algorithm and Variants Revisited
• A linear bound for sliding-block decoder window size
• scientific article; zbMATH DE number 3871179
• On the asymptotic behaviour of Lee-codes
• A linear bound for sliding-block decoder window size. II
• A modification of the Zinoviev lower bound for constant weight codes
• Sliding-window dynamic frameproof codes
• Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound

Cited in

(4)

• Practical fixed length Lempel-Ziv coding
• Efficient Error-Correcting Codes for Sliding Windows
• On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm
• Sliding-window dynamic frameproof codes

This page was built for publication: On asymptotic optimality of a sliding window variation of Lempel-Ziv codes

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