Constructing finitary isomorphisms with finite expected coding times
Irreducible Markov shifts with the same entropy were shown to be finitarily isomorphic by \textit{M. Keane} and \textit{M. Smorodinsky} [Isr. J. Math. 34, 281-286 (1979; Zbl 0431.28015)]. In light of their result, it is natural to ask for additional computable invariants that guarantee the more natural property of having an isomorphism with finite expected coding length (a measure of how far the code must look into the past and future). Early work showed that additional invariants are certainly needed, and eventually the natural hope seemed to be that the invariants \(\beta,\Delta,c\Delta\) formed a complete set of invariants for finitary isomorphism with finite expected coding length. This central hope remains an open question -- an attractive survey is the paper of \textit{W. Parry} [Bull. Lond. Math. Soc. 23, 1-33 (1991; Zbl 0808.28013)]. Here the authors construct a finitary isomorphism with finite expected coding length under an additional positivity assumption. In particular, they show that Markov chains are finitarily isomorphic with finite expected coding time if there is a matrix (over a suitable ring) intertwining the matrices defining the Markov chains that has a positive row and a positive column.
- Finitary Codes, a short survey
- An invariant of finitary codes with finite expected square root coding length
- Invariants for finitary isomorphisms with finite expected code lengths
- The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation
- On the marker method for constructing finitary isomorphisms
- Bernoulli schemes of the same entropy are finitarily isomorphic
- Conditional pressure and coding
- Finitary isomorphisms of irreducible Markov shifts
- Finitary Isomorphisms with Finite Expected Code Lengths
- scientific article; zbMATH DE number 3762994 (Why is no real title available?)
- scientific article; zbMATH DE number 177174 (Why is no real title available?)
- scientific article; zbMATH DE number 3799981 (Why is no real title available?)
- Hyperbolic structure preserving isomorphisms of Markov shifts
- Hyperbolic structure preserving isomorphisms of Markov shifts. II
- Invariants for finitary isomorphisms with finite expected code lengths
- Natural coefficients and invariants for Markov-shifts
- Notes on Coding Problems for Finite State Processes
- On the finitary isomorphisms of markov shifts that have finite expected coding time
- On the Stochastic and Topological Structure of Markov Chains
- Optical phase conjugation: principles, techniques, and applications
- The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains
- Topological entropy and equivalence of dynamical systems
- When does a submodule of \((\mathbb{R}[x_1,\dots,x_k])^n\) contain a positive element?
- Natural coefficients and invariants for Markov-shifts
- Invariants for finitary isomorphisms with finite expected code lengths
- Hyperbolic structure preserving isomorphisms of Markov shifts
- Finitary coding for the sub-critical Ising model with finite expected coding volume
- Notes on finitary isomorphism markers in countable state Markov processes
- An invariant of finitary codes with finite expected square root coding length
- Invariants of finitary isomorphisms with finite expected code-lengths
- Almost isomorphism for countable state Markov shifts
- Regular isomorphism of Markov chains is almost topological
- A return time invariant for finitary isomorphisms
- scientific article; zbMATH DE number 4042220 (Why is no real title available?)
- On the marker method for constructing finitary isomorphisms
- On Finite Coding Factors of a Class of Random Markov Chains
- Any two irreducible Markov chains of equal entropy are finitarily Kakutani equivalent
This page was built for publication: Constructing finitary isomorphisms with finite expected coding times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860715)
