Teor. Veroyatnost. i Primenen., 1962 Volume 7, Issue 3, Pages 342–343
(Mi tvp4731)
|
Short Communications
The Average Length of a Minimum Redundancy Binary Code for Probabilities of
Coded Symbols not Differing Greatly From Each Other
S. S. Kislitsyn Leningrad
Abstract:
The average length of a Huffman binary code [1] is obtained for the case when
$p_1\leq p_{n-1}+p_n$.
Received: 31.10.1961
© , 2024
Fulltext:
PDF file (219 kB)
