Skip to main content

How to Transmit Information Reliably with Unreliable Elements (Shannon’s Theorem)

  • Chapter
  • First Online:
Novelty, Information and Surprise
  • 807 Accesses

Abstract

The goal of our rather technical excursion into the field of stationary processes was to formulate and prove Shannon’s theorem. This is done in this last chapter of Part III.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Feinstein, A. (1954). A new basic theorem of information theory. IRE Transactions on Information Theory, 4, 2–22.

    Google Scholar 

  2. Feinstein, A. (1959). On the coding theorem and its converse for finite-memory channels. Information and Control, 2, 25–44.

    Google Scholar 

  3. Gray, R. M. (1990). Entropy and information theory. New York: Springer.

    Google Scholar 

  4. Kieffer, J. (1981). Block coding for weakly continuous channels. IEEE Transactions on Information Theory, 27(6), 721–727.

    Google Scholar 

  5. McMillan, B. (1953). The basic theorems of information theory. Annals of Mathematical Statistics, 24, 196–219.

    Google Scholar 

  6. Pfaffelhuber, E. (1971). Channels with asymptotically decreasing memory and anticipation. IEEE Transactions on Information Theory, 17(4), 379–385.

    Google Scholar 

  7. Shannon, C. E. (1948). A mathematical theory of communication. Bell Systems Technical Journal, 27, 379–423, 623–656.

    Google Scholar 

  8. Shannon, C. E. & Weaver, W. (1949). The mathematical theory of communication. Champaign: University of Illinois Press.

    Google Scholar 

  9. Wolfowitz, J. (1964). Coding theorems of information theory (2nd ed.). Springer-Verlag New York, Inc.: Secaucus.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Palm, G. (2012). How to Transmit Information Reliably with Unreliable Elements (Shannon’s Theorem). In: Novelty, Information and Surprise. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29075-6_8

Download citation

Publish with us

Policies and ethics