Constructing finitary isomorphisms with finite expected coding times

DOI10.1007/BF02784521zbMath1015.37007MaRDI QIDQ1860715

Selim Tuncel, Robert Mouat

Publication date: 10 July 2003

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Markov chainsfinitary isomorphismcoding times

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Entropy and other invariants, isomorphism, classification in ergodic theory (37A35) Symbolic dynamics (37B10)

Related Items

Almost isomorphism for countable state Markov shifts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Natural coefficients and invariants for Markov-shifts
• Invariants for finitary isomorphisms with finite expected code lengths
• Hyperbolic structure preserving isomorphisms of Markov shifts. II
• Finitary isomorphisms of irreducible Markov shifts
• Conditional pressure and coding
• Bernoulli schemes of the same entropy are finitarily isomorphic
• When does a submodule of \((\mathbb{R}[x_1,\dots,x_k)^n\) contain a positive element?]
• Hyperbolic structure preserving isomorphisms of Markov shifts
• On the finitary isomorphisms of markov shifts that have finite expected coding time
• Finitary Isomorphisms with Finite Expected Code Lengths
• On the Stochastic and Topological Structure of Markov Chains
• Optical phase conjugation: principles, techniques, and applications
• Notes on Coding Problems for Finite State Processes
• Topological entropy and equivalence of dynamical systems
• The weight-per-symbol polytope and scaffolds of invariants associated with Markov chains