Relative uniformity of sources and the comparison of optimal code costs
Julia Abrahams · IEEE Transactions on Information Theory · 1993
Conditions on the probability distributions of two sources that describe their relative uniformity are shown to be sufficient for inequalities on their minimum average codeword lengths and entropies. The Huffman coding problem and variants involving Renyi entropy are addressed.>