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-17T00:00:00.000Z
Duration: 1 h 12 min 20 s
Description: Shannon’s noisy coding theorem says that on a binary symmetric channel (BSC) with flip probability \(p\), you can transmit at any constant rate strictly below capacity \(1-H(p)\) with decoding error going to zero as b...

MIT OpenCourseWare · 72:20

Shannon’s noisy coding theorem says that on a binary symmetric channel (BSC) with flip probability \(p\), you can transmit at any constant rate strictly below capacity \(1-H(p)\) with decoding error going to zero as b...

Read the full summary on tuber