Lecture 17: Huffman Coding
MIT OpenCourseWare · 77:58
Huffman coding is a greedy algorithm that builds an optimal prefix-free code for a first-order source: merge the two lowest-probability symbols into a parent, recurse, then expand the tree back out. The resulting expe...