Markov Types and Minimax Redundancy for Markov Sources

DOI10.1109/TIT.2004.830765MaRDI QIDQ3547056zbMATH OpenFDO

Authors Wojciech Szpankowski, Philippe Jacquet

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.2004.830765

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Statistical aspects of information-theoretic topics (62B10) Combinatorics in computer science (68R05) Information theory (general) (94A15) Source coding (94A29)

Recommendations

• scientific article; zbMATH DE number 1984551
• Minimax noiseless universal coding for Markov sources
• Precise Minimax Redundancy and Regret
• Universal redundancy rates do not exist
• scientific article; zbMATH DE number 5941301

Cited in

(8)

• Scrambling in Yang-Mills
• Analysis of radix selection on Markov sources
• Minimax noiseless universal coding for Markov sources
• scientific article; zbMATH DE number 524372 (Why is no real title available?)
• Minimax redundancy for the class of memoryless sources
• scientific article; zbMATH DE number 1984551 (Why is no real title available?)
• The asymptotic redundancy of Bayes rules for Markov chains
• Average Redundancy of the Shannon Code for Markov Sources

This page was built for publication: Markov Types and Minimax Redundancy for Markov Sources

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