Skip to main content

An information obstruction to finite expected coding length

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

Keywords

  • Positive Measure
  • Lebesgue Space
  • Code Length
  • Countable Union
  • Tile Space

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (Canada)
  • 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

Learn about 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.

    CrossRef  MathSciNet  MATH  Google Scholar 

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

    CrossRef  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.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

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