Shannon's Noisy-Channel Coding Theorem

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Shannon's noisy-channel coding theorem states that for any given degree of noise in a communication channel, it is possible to communicate a message nearly error-free up to some maximum rate through the channel. This Demonstration illustrates how the introduction of noise in a channel can be compensated with the introduction of redundancy, by sending multiple copies of every bit.

Contributed by: Hector Zenil and Elena Villarreal (August 2012)
Open content licensed under CC BY-NC-SA


Snapshots


Details

Reference

[1] C. E. Shannon, A Mathematical Theory of Communication, Urbana, IL: University of Illinois Press, 1949.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send