On Finite Coding Factors of a Class of Random Markov Chains

DOI10.4153/CMB-1994-058-2MaRDI QIDQ4312067zbMATH OpenFDO

Authors Maurice Rahe

Publication date 28 November 1994

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CMB-1994-058-2

zbMATH Keywords

Bernoulli shiftsfinitarily isomorphicgeneralized Baker's transformationrandom Markov chainssplitting-off theorem

Mathematics Subject Classification ID

Measure-preserving transformations (28D05) Stationary stochastic processes (60G10)

Recommendations

• Constructing finitary isomorphisms with finite expected coding times
• Sur les processus quasi-Markoviens et certains de leurs facteurs
• Finitary Codes, a short survey
• Coding Markov chains from the past
• Code length between Markov processes

Cited in

(8)

• Coding Markov chains from the past
• scientific article; zbMATH DE number 4025761 (Why is no real title available?)
• Powers of positive polynomials and codings of Markov chains onto Bernoulli shifts
• Markov chains with exponential return times are finitary
• Random Markov processes for countable and uncountable alphabets
• On Mealy–Moore coding and images of Markov measures
• Markov capacity for factor codes with an unambiguous symbol
• On the greatest prime factor of Markov pairs

This page was built for publication: On Finite Coding Factors of a Class of Random Markov Chains

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