Redundancy of Unbounded Memory Markov Classes with Continuity Conditions
Redundancy of Unbounded Memory Markov Classes with Continuity Conditions
We study the redundancy of universally compressing strings X <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> , ...,Xn generated by a binary Markov source p without any bound on the memory. To better understand the connection between compression and estimation in the Markov regime, we consider a class of Markov sources restricted by a …