Optimal prefix codes and Huffman coding

[34/97%]

Subtopics

Finite-state transducers[24/96%]
Kraft-McMillan inequality[5/100%]
Constructing a Huffman code for a given symbol-frequency table[2/100%]
Optimal code-word length spread under (near-)equal frequencies[2/100%]
Steps in the Huffman algorithm's optimality proof[1/100%]