You are viewing a single comment's thread.

view the rest of the comments →

0
0

[–] 19375018? ago 

Oh, Huffman compression. Why didn't you say so. That makes perfect sense.

0
0

[–] 19376595? 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.

Shorter codes equal smaller file.