The Average Length of a Minimum Redundancy Binary Code for Probabilities of
Coded Symbols not Differing Greatly From Each Other
Abstract
The average length of a Huffman binary code [1] is obtained for the case when $p_1\leq p_{n-1}+p_n$ .
Submission history
[v1] 1962