Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources

DOI10.1109/TIT.2002.1013141MaRDI QIDQ4674559zbMATH OpenOpenAlexFDO

Authors Ioan Tabus, Jorma Rissanen

Publication date 11 May 2005

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

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

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 5941301
• Variable to fixed-length codes for Markov sources
• Universal variable-to-fixed length source codes
• Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
• Variable-to-fixed length codes and the conservation of entropy

Cited in

(3)

• On asymptotically optimal methods of prediction and adaptive coding for Markov sources
• scientific article; zbMATH DE number 5941301 (Why is no real title available?)
• A Note on Approximation of Uniform Distributions From Variable-to-Fixed Length Codes

This page was built for publication: Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources

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