Shannon's Noisy-Channel Coding Theorem
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.
References
References
[1] C. E. Shannon, A Mathematical Theory of Communication, Urbana, IL: University of Illinois Press, 1949.
External Links
External Links
Permanent Citation
Permanent Citation
Hector Zenil, Elena Villarreal
"Shannon's Noisy-Channel Coding Theorem"
http://demonstrations.wolfram.com/ShannonsNoisyChannelCodingTheorem/
Wolfram Demonstrations Project
Published: August 27, 2012