Title :
Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes - Part 2
Author :
Zaharia, Gheorghe ; Munteanu, Valeriu ; Tarniceriu, Daniela
Author_Institution :
IETR, INSA de Rennes, Rennes, France
Abstract :
This paper presents the lower bound on the average codeword length of the D-ary Huffman codes. Two extreme cases are analyzed: the quasi-uniform and anti-uniform Huffman codes. For each case the codeword lengths are computed. The histogram of the average codeword length obtained by simulation confirms the bound on the average codeword lengths. The lower bound computed in this paper is lower than the value obtained for Huffman codes with minimum redundancy.
Keywords :
Huffman codes; D-ary Huffman codes; antiuniform Huffman codes; codeword lengths; quasi-uniform Huffman codes; tight bounds; Computational modeling; Encoding; Histograms; Information technology; Probability distribution; Telecommunication computing; Upper bound;
Conference_Titel :
Signals, Circuits and Systems, 2009. ISSCS 2009. International Symposium on
Conference_Location :
Iasi
Print_ISBN :
978-1-4244-3785-6
Electronic_ISBN :
978-1-4244-3786-3
DOI :
10.1109/ISSCS.2009.5206162
