Minimum codeword length and redundancy of Huffman codes

RM Capocelli, A De Santis - … on Coding Theory and Applications (held in …, 1990 - Springer
A tight upper bound on the redundancy r of Huffman codes, in terms of the minimum
codeword length l, l≥ 1, is provided. The bound is a strictly decreasing function of l. For …
被引用次数：5 相关文章

Minimum codeword length

RM Capocelli, A De Santis - … , Udine, Italy, November 5-9, 1990 …, 1991 - books.google.com
Minimum codeword length Page 323 Minimum codeword length and redundancy of Huffman
codes* Renato M. Capocelli Dipartimento di Matematica Università di Roma" La Sapienza" …

Minimum codeword length and redundancy of Huffman codes

RM Capocelli, A Santis - EUROCODE'90 - infona.pl
A tight upper bound on the redundancy r of Huffman codes, in terms of the minimum
codeword length l, l≥ 1, is provided. The bound is a strictly decreasing function of l. For …

[引用][C] Minimum codeword length and redundancy of Huffman codes

RM Capocelli, AD Santis - … of the International Symposium on Coding …, 1990 - dl.acm.org
Minimum codeword length and redundancy of Huffman codes | Proceedings of the International
Symposium on Coding Theory and Applications skip to main content ACM Digital Library home …

[引用][C] Minimum codeword length and redundancy of Huffman codes

R Capocelli, A De Santis - EUROCODE'90, 1991 - Springer