Name: Lecture 17: Huffman Coding
Uploaded: 2025-12-17T16:28:24Z
Duration: 1 h 17 min 59 s
Description: 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.

1:17:59

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.