Chains, entropy, coding

Karl Petersen
1986 Ergodic Theory and Dynamical Systems  
Various definitions of the entropy for countable-state topological Markov chains are considered. Concrete examples show that these quantities do not coincide in general and can behave badly under nice maps. Certain restricted random walks which arise in a problem in magnetic recording provide interesting examples of chains. Factors of some of these chains have entropy equal to the growth rate of the number of periodic orbits, even though they contain no subshifts of finite type with positive
more » ... ropy; others are almost sofic-they contain subshifts of finite type with entropy arbitrarily close to their own. Attempting to find the entropies of such subshifts of finite type motivates the method of entropy computation by loop analysis, in which it is not necessary to write down any matrices or evaluate any determinants. A method for variable-length encoding into these systems is proposed, and some of the smaller subshifts of finite type inside these systems are displayed.
doi:10.1017/s014338570000359x fatcat:ahnj7llapjhhnjtedr5v5jctne