Coding Markov chains from the past

DOI10.1007/BF02776030zbMath0766.28006MaRDI QIDQ1196317

James Propp

Publication date: 16 December 1992

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

zbMATH Keywords

entropydynamical systemshift mapfactor mapmixing Markov chainsOrnstein's isomorphism theoryRudolph's theory of joiningssymbolic stochastic processunilaterally factorunilaterally finitely determined process

Mathematics Subject Classification ID

Measure-preserving transformations (28D05) Entropy and other invariants (28D20)

Related Items (1)

A monotone Sinai theorem

Cites Work

• Unilateral codings of Bernoulli systems
• A Shannon-McMillan theorem for motley names
• On the Optimum Rate of Transmitting Information
• The Basic Theorems of Information Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coding Markov chains from the past