Lecture 17: Huffman Coding

MIT 18.200 Principles of Discrete Applied Mathematics, Spring 2024
Instructor: Ankur Moitra
View the complete course: https://ocw.mit.edu/courses/18-200-principles-of-discrete-applied-mathematics-spring-2024
YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP61p2fXeXjNCrfNHFwyW-bl0

Uploaded 17-12-25

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.

License: Creative Commons BY-NC-SA
More information at https://ocw.mit.edu/terms
More courses at https://ocw.mit.edu
Support OCW at http://ow.ly/a1If50zVRlQ

We encourage constructive comments and discussion on OCW’s YouTube and other social media channels. Personal attacks, hate speech, trolling, and inappropriate comments are not allowed and may be removed. More details at https://ocw.mit.edu/comments.



Learn more about your ad choices. Visit megaphone.fm/adchoices

Learn more about your ad choices. Visit megaphone.fm/adchoices