Huffman Coding

More info

Enter a message and see a Huffman tree automatically generated to display frequency counts, variable-length codes, and how many bits are saved compared with 8-bit ASCII storage.

Input

ASCII Bits

characters x 8

Huffman Bits

sum of frequency x code length

Bits Saved

0.0% reduction

Encoded Output

Tree

Branch label 0 means left, and 1 means right. Read from root to a leaf to get each character code.

Codes

Char	Frequency	Code	Bits