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 16 - Data Compression and Shannon's Noiseless Coding Theorem |
We start with the history of data compression. We define a first-order source, and what it means to compress it. We define entropy. We then state and prove Shannon's noiseless coding theorem, which gives the optimal compression ratio a first-order source.
Go to the Course Home or watch other lectures: