18.200 Principles of Discrete Applied Mathematics
18.200 Principles of Discrete Applied Mathematics (Spring 2024, MIT OCW). Instructors: Prof. Ankur Moitra, Prof. Peter Shor, and Susan Ruff. This course will teach you illustrative topics in discrete applied mathematics, including counting, generating functions, probability, linear optimization, algebraic structures, basic number theory, information theory, and coding theory. It is a CI-M (Communication Intensive in the Major) course and thus includes a writing component. (from ocw.mit.edu)
| Lecture 18 - Transmitting Information Reliably over a Noisy Channel and 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.
Go to the Course Home or watch other lectures: