Lecture 18: Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem

Name: Lecture 18: Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem
Uploaded: 2025-12-17T16:28:15Z
Duration: 1 h 12 min 21 s
Description: How do you transmit information reliably over noisy channels? We first discuss simple codes: repetition codes. Shannon’s noisy coding theorem shows much better codes exist. We prove the simplest case of this theorem—for the binary symmetric channel.

1:12:21

How do you transmit information reliably over noisy channels? We first discuss simple codes: repetition codes. Shannon’s noisy coding theorem shows much better codes exist. We prove the simplest case of this theorem—for the binary symmetric channel.