[prev] 77 [next]

Huffman Code

Huffman's algorithm
  • computes frequency f(c) for each character
  • successively combines pairs of lowest-frequency characters to build encoding tree "bottom-up"
Example: abracadabra

[Diagram:Pic/huffman-tree.png]