The Huffman tree gives a short code to common symbols and a long code to rare ones → the average bits approach the entropy H — the theoretical limit of lossless compression.
—
Pick a ‘Scenario’ (skewed / uniform / runs / lossy…) · click a symbol or concept for details
Your browser has canvas disabled.
Actual vs ideal (Shannon) bits per symbolactual bits (Huffman code)ideal bits −log₂(p)