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 17 - Huffman Coding |
We review Shannon's noiseless coding theorem. We define prefix free codes and show that they can be efficiently decoded by using a binary tree. We then give Huffman's algorithm for finding the optimal prefix free code.
Go to the Course Home or watch other lectures: