|
Teoriya Veroyatnostei i ee Primeneniya, 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
Citation:
S. S. Kislitsyn, “The Average Length of a Minimum Redundancy Binary Code for Probabilities of
Coded Symbols not Differing Greatly From Each Other”, Teor. Veroyatnost. i Primenen., 7:3 (1962), 342–343; Theory Probab. Appl., 7:3 (1962), 331–333
Linking options:
https://www.mathnet.ru/eng/tvp4731 https://www.mathnet.ru/eng/tvp/v7/i3/p342
|
Statistics & downloads: |
Abstract page: | 172 | Full-text PDF : | 64 |
|