New bounds on the redundancy of Huffman codes
Renato M. Capocelli, Alfredo De Santis · IEEE Transactions on Information Theory · 1991
Upper and lower bounds are obtained for the redundancy of binary Huffman codes for a memoryless source whose least likely source letter probability is known. Tight upper bounds on redundancy in terms of the most and least likely source letter probabilities are provided.>