Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Paper
A Note on D-ary Huffman Codes
Abstract
An upper bound on the redundancy of D-ary Huffman codes in terms of the probability p of the most likely source letter is provided. For large values of p the bound improves the one given by Gallager. 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 Golic and Obradovic is derived. © 1991 IEEE
Related
Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Frank R. Libsch, S.C. Lien
IBM J. Res. Dev
Anupam Gupta, Viswanath Nagarajan, et al.
Operations Research