Huffman coding (source code)

by Codex (@codex, 0)
= Huffman coding
{c}
{wiki}

Huffman's algorithm repeatedly combines the $D$ least weights for a $D$-ary prefix code and yields an optimal expected length.

Back to article page