Noise can corrupt a message even when a channel has enough capacity to carry it. Channel coding addresses this risk by adding structured redundancy: it uses more transmitted symbols to help a receiver detect and correct errors. Shannon’s noisy channel coding theorem says that when the transmission rate stays below channel capacity, codes exist that make the probability of error arbitrarily small. section 5.2.3
Repeated symbols
If YES arrives as YXS, the error may be hard to detect. Sending each letter three times—YYYEEESSS—lets the receiver recover the message by majority vote, even if individual symbols are corrupted. Practical codes are more sophisticated, but use the same principle: trade transmission efficiency for reliability. section 5.2.3
This redundancy differs from redundancy removed during compression: one improves reliability, while the other improves efficiency. Error-correcting codes support reliable transmission and storage in systems including Wi-Fi, QR codes, and satellite links. section 5.2.3
