Huffman Coding
Optimal prefix-free compression — frequent symbols get shorter codes
the quick brown fox jumps over the lazy dog
Build Huffman Tree
Step Through
Reset
← type any text, then build
--
Original bits (ASCII)
--
Huffman bits
--
Compression ratio
--
Shannon entropy (bits/sym)
--
Avg code length
Sym
Freq
Prob
Code
Bits
Enter text and click "Build Huffman Tree"