Finitary codes between Markov processes

DOI10.1007/BF00535166zbMATH Open0403.28017MaRDI QIDQ4188022FDOQ4188022

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)

zbMATH Keywords

EntropyMarkov ChainsStationary Stochastic ProcessesShiftsFinitaryMeasure-Preserving Map

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of finitary codes
• Similarity of automorphisms of the torus

Cited In (16)

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

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)