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.
Course Info
Instructors
Departments
As Taught In
Spring
2024
Level
Topics
Learning Resource Types
theaters
Lecture Videos
notes
Lecture Notes
assignment
Problem Sets
Editable Files
