Enter the string here:

Specify the base:
The Huffman encoded string is:


The average length of a symbol in the Huffman code is 0 bits.
The average length of a symbol in the equal-length code is 0 bits.
The Shannon entropy of the input string is 0 bits per symbol.
The collision entropy of the input string is 0 bits per symbol.

If you are interested in this, perhaps you might want to read the paper I've written in Croatian about it.

UPDATE on 24/05/2024: I've implemented the Huffman's algorithm in AEC.