Huffman Coding

Input text Preset Build

Speed

Show code table Show encoded bitstring

Statistics

Symbols—

Total characters—

Fixed-length bits—

Huffman bits—

Compression ratio—

Avg code length—

Entropy H (bits/sym)—

Huffman repeatedly merges the two lowest-frequency nodes from a min-priority-queue into one parent, until a single root remains. Walking left = 0, right = 1 yields an optimal prefix-free code: frequent symbols get short codes. Total length stays within 1 bit/symbol of the entropy H.