Title :
Relative uniformity of sources and the comparison of optimal code costs
Author_Institution :
Div. of Math. Sci., Office of Naval Res., Arlington, VA
fDate :
9/1/1993 12:00:00 AM
Abstract :
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
Keywords :
Huffman codes; encoding; entropy; probability; Huffman coding; Renyi entropy; minimum average codeword lengths; optimal code costs; relative uniformity; source probability distributions; Cost function; Entropy; Huffman coding; Information science; Probability distribution;
Journal_Title :
Information Theory, IEEE Transactions on
