The core of Huffman's algorithm is a KL-optimal frequency normaliser: This implies that any distribution can be optimally transformed into an dyadic one, making code lengths and thus codes obvious.
The paper unifies Huffman, ANS, and arithmetic coding: This suggests a new approach to creating optimal prefix codes that could revolutionize data compression techniques.
