Lecture 17: Huffman Coding

Om kurset

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.