Markov Types and Minimax Redundancy for Markov Sources

DOI10.1109/TIT.2004.830765zbMath1303.94040MaRDI QIDQ3547056

Wojciech Szpankowski, Philippe Jacquet

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) 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) Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10) Source coding (94A29)

Related Items (1)

Scrambling in Yang-Mills

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