One Bit Too Many
Huffman coding is provably optimal and famously within one bit of entropy. On the right source that one bit is a twelve-fold overhead.
3 projects

Huffman coding is provably optimal and famously within one bit of entropy. On the right source that one bit is a twelve-fold overhead.

A loud sound hides quiet ones for a fifth of a second afterwards, and for a few milliseconds beforehand.

A loud tone does not make its quiet neighbour quieter. It makes it not exist. This is why MP3 works.