WOLFRAM NOTEBOOK

WOLFRAM|DEMONSTRATIONS PROJECT

Shannon's Noisy-Channel Coding Theorem

​
message
structured
random
message length
100
noise
0.1
redundancy
1
random seed
1
transmitted message
received message
(runtime: 0.002264)
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.
Wolfram Cloud

You are using a browser not supported by the Wolfram Cloud

Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.


I understand and wish to continue anyway »

You are using a browser not supported by the Wolfram Cloud. Supported browsers include recent versions of Chrome, Edge, Firefox and Safari.