Optimal Length-limited Huffman Encoding
Gzip compression algorithm uses Huffman encoding to encode literals, lengths and offset alphabets but limits maximum code length to 15 bits.
GNU gzip v1.2.4 uses a balancing heuristic to avoid assigning long codes.
The improved implementation uses the package-merge algorithm [Turpin & Moffat 95] to find optimal length-limited codes.