A note on D-ary Huffman codes |
| |
| Authors: | Capocelli R.M. De Santis A. |
| |
| Affiliation: | Dipartimento di Matematica, Roma Univ.; |
| |
| Abstract: | An upper bound on the redundancy of D-ary Huffman codes in terms of the probability p1 of the most likely source letter is provided. For large values of p1, the bound improves the one given by R.G. Gallager (1978). Additionally, some results known for the binary case (D=2) are extended to arbitrary D-ary Huffman codes. As a consequence, a tight lower bound that corrects a bound recently proposed by J.D. Golic and M.M. Obradovic (1987) is derived |
| |
| Keywords: | |
|
|
