Skip to main content
SpringerLink
Log in

An information obstruction to finite expected coding length

  • Conference paper
  • First Online:
Ergodic Theory

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 729))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Bowen. Smooth partitions of Anosov diffeomorphisms are weak Bernoulli. Israel J. Math. 21(1975) 95–100.

    Article  MathSciNet  MATH  Google Scholar 

  2. R. Fellgett & W. Parry. Endomorphisms of a Lebesgue space II. Bull. L.M.S. 7(1975), 151–158.

    Article  MathSciNet  MATH  Google Scholar 

  3. M. Keane & M. Smorodinsky. Bernoulli schemes of the same entropy are finitely isomorphic. (To appear.)

    Google Scholar 

  4. W. Parry. Finitary isomorphisms with finite expected code lengths. (To appear.)

    Google Scholar 

  5. W. Parry. Endomorphisms of a Lebesgue space III. Israel J. Maths. 21(1975), 167–172.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Authors
  1. William Parry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manfred Denker Konrad Jacobs

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag

About this paper

Cite this paper

Parry, W. (1979). An information obstruction to finite expected coding length. In: Denker, M., Jacobs, K. (eds) Ergodic Theory. Lecture Notes in Mathematics, vol 729. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0063292

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09517-0

  • Online ISBN: 978-3-540-35130-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation