Shannon's Noisy-Channel Coding Theorem

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.

SNAPSHOTS

  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]
  • [Snapshot]

DETAILS

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

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.