Lecture 18: Transmitting Information Reliably over a Noisy Channel & Shannon’s Noisy Coding Theorem
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.
Course Info
Instructors
Departments
As Taught In
Spring
2024
Level
Topics
Learning Resource Types
edit_note
Editable Files
notes
Lecture Notes
theaters
Lecture Videos
assignment
Problem Sets
