[+]19376595?0 points0 points0 points
ago
(edited ago)
[–]19376595?0 points
0 points
0 points
(+0|-0)
ago
(edited ago)
Huffman compression creates a binary tree of the most common bytes in an input file. The path through the tree to any specific byte is often shorter, in terms of bits, than the length of a byte.