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.