Summary
A necessary condition is given for a finitary isomorphism between mixing Markov shifts of equal entropy to have finite expected coding time.
Article PDF
Similar content being viewed by others
References
Keane, M., Smorodinsky, M.: Finitary isomorphisms of irreducible Markov shifts. Israel J. of Math. 34, 282–286 (1979)
Krieger, W.: On non-singular transformations of a measure space I. Zeitschrift für Wahrscheinlichkeitstheorie verw. Gebiete 11, 87–97 (1969)
Krieger, W.: On non-singular transformations of a measure space II. Zeitschrift für Wahrscheinlichkeitstheorie verw. Gebiete 11, 98–119 (1969)
Parry, W.: Finitary isomorphisms with finite expected code lengths. Bull. London Math. Soc. 11, 170–176 (1979)
Author information
Authors and Affiliations
Additional information
This work was done at the Sonderforschungsbereich “Stochastische Mathematische Modelle” at the University of Heidelberg under the auspices of the Deutsche Forschungsgemeinschaft.
Rights and permissions
About this article
Cite this article
Krieger, W. On the finitary isomorphisms of markov shifts that have finite expected coding time. Z. Wahrscheinlichkeitstheorie verw Gebiete 65, 323–328 (1983). https://doi.org/10.1007/BF00532486
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF00532486