Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
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
Qing Li, Zhigang Deng, et al.
IEEE T-MI
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003