Skip to main content
Log in

Invariants for finitary isomorphisms with finite expected code lengths

  • Published:
Inventiones mathematicae Aims and scope

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Butler, R., Schmidt, K.: An information cocycle for groups of nonsingular transformations. Preprint (Warwick, 1982)

  2. Keane, M., Smorodinsky, M.: Finitary isomorphisms of irreducible Markov shifts. Israel J. Math34, 281–286 (1979)

    Google Scholar 

  3. Krieger, W.: On the finitary isomorphisms of Markov shifts that have finite expected coding time. Z. Wahrscheinlichkeitstheorie und verw. Gebiete65, 323–328 (1983)

    Google Scholar 

  4. Parry, W.: Finitary isomorphisms with finite expected code-lengths. Bull. London Math. Soc.11, 170–176 (1979)

    Google Scholar 

  5. Parry, W., Schmidt, K.: Natural coefficients and invariants for Markov shifts. Invent. math.76, 15–32 (1984)

    Google Scholar 

  6. Parry, W., Tuncel, S.: On the classification of Markov chains by finite equivalence. Ergod. Th. and Dynam. Sys.1, 303–335 (1981)

    Google Scholar 

  7. Rosenblatt, M.: Stationary processes as shifts of functions of independent random variables. J. Math. Mech.8, 665–681 (1959)

    Google Scholar 

  8. Tuncel, S.: Conditional pressure and coding. Israel J. Math.39, 101–112 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schmidt, K. Invariants for finitary isomorphisms with finite expected code lengths. Invent Math 76, 33–40 (1984). https://doi.org/10.1007/BF01388489

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01388489

Keywords

Navigation