Finitary codes between Markov processes
From MaRDI portal
Publication:4188022
DOI10.1007/BF00535166zbMath0403.28017MaRDI QIDQ4188022
Andrés Del Junco, Maurice Rahe, Mustafa A. Akcoglu
Publication date: 1979
Published in: Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete (Search for Journal in Brave)
Stationary stochastic processes (60G10) Measure-preserving transformations (28D05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Entropy and other invariants (28D20) Communication, information (94A99)
Related Items (15)
The positive-divergence and blowing-up properties ⋮ A monotone Sinai theorem ⋮ Unnamed Item ⋮ Finitary isomorphisms of irreducible Markov shifts ⋮ Almost topological dynamical systems ⋮ Random interlacement is a factor of i.i.d. ⋮ A note on r-processes ⋮ Finitary isomorphism of some renewal processes to Bernoulli schemes ⋮ Markov chains with exponential return times are finitary ⋮ Code length between Markov processes ⋮ The finitary isomorphism theorem for Markov shifts ⋮ Finitary coding of Markov random fields ⋮ PERFECTION IN R-PROCESSES ⋮ On the existence and nonexistence of finitary codings for a class of random fields ⋮ Finitary codings for spatial mixing Markov random fields
Cites Work
This page was built for publication: Finitary codes between Markov processes