Finitary codes between Markov processes

DOI10.1007/BF00535166MaRDI QIDQ4188022zbMATH OpenFDO

Authors A. Del Junco, Mustafa Akcoglu, Maurice Rahe

Publication date 1979

Published in Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00535166

zbMATH Keywords

EntropyFinitaryMarkov ChainsMeasure-Preserving MapShiftsStationary Stochastic Processes

Mathematics Subject Classification ID

Measure-preserving transformations (28D05) Entropy and other invariants (28D20) Stationary stochastic processes (60G10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Communication, information (94A99)

Cites work

• A class of finitary codes
• scientific article; zbMATH DE number 3227613 (Why is no real title available?)
• scientific article; zbMATH DE number 3278887 (Why is no real title available?)
• Similarity of automorphisms of the torus

Cited in

(16)

• Finitary isomorphisms of irreducible Markov shifts
• Almost topological dynamical systems
• The positive-divergence and blowing-up properties
• On the existence and nonexistence of finitary codings for a class of random fields
• Code length between Markov processes
• A monotone Sinai theorem
• scientific article; zbMATH DE number 3863086 (Why is no real title available?)
• PERFECTION IN R-PROCESSES
• The finitary isomorphism theorem for Markov shifts
• Finitary coding of Markov random fields
• A note on r-processes
• Markov chains with exponential return times are finitary
• Random interlacement is a factor of i.i.d.
• Sinai factors of nonsingular systems: Bernoulli shifts and Anosov flows
• Finitary codings for spatial mixing Markov random fields
• Finitary isomorphism of some renewal processes to Bernoulli schemes

This page was built for publication: Finitary codes between Markov processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4188022)