Skip to main content

Communicating without errors

  • Chapter
Book cover Proofs from THE BOOK

Abstract

In 1956, Claude Shannon, the founder of information theory, posed the following very interesting question:

Suppose we want to transmit messages across a channel (where some symbols may he distorted) to a receiver. What is the maximum rate of transmission such that the receiver may recover the original message without errors?

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 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. V. Chvátal: Linear Programming, Freeman, New York 1983.

    MATH  Google Scholar 

  2. W. Haemers: Eigenvalue methods,in: “Packing and Covering in Combinatorics” (A. Schrijver, ed.), Math. Centre Tracts 106 (1979), 15-38.

    Google Scholar 

  3. L. Lovász: On the Shannon capacity of a graph, IEEE Trans. Information Theory 25 (1979), 1 - 7.

    Article  MATH  Google Scholar 

  4. C. E. Shannon: The zero-error capacity of a noisy channel, IRE Trans. Information Theory 3 (1956), 3 - 15.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Aigner, M., Ziegler, G.M. (1998). Communicating without errors. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-22343-7_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-22343-7_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-22345-1

  • Online ISBN: 978-3-662-22343-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics