Title :
Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels
Author :
Munteanu, Valeriu ; Tarniceriu, Daniela
Author_Institution :
Fac. of Electron. & Telecommun., Iasi
Abstract :
For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of Huffman encoding, we derive the upper and lower bounds of average codeword length.
Keywords :
Huffman codes; probability; telecommunication channels; Huffman encoding; code alphabet; codeword length; discrete source; lower bounds; noiseless channels; optimal codes; optimum probability distribution; upper bounds; Distributed computing; Electronic mail; Encoding; Entropy; Huffman coding; Lagrangian functions; Length measurement; Probability distribution; Time measurement; Upper bound; Huffman coding; average codeword length;
Conference_Titel :
Signals, Circuits and Systems, 2007. ISSCS 2007. International Symposium on
Conference_Location :
Iasi
Print_ISBN :
1-4244-0969-1
Electronic_ISBN :
1-4244-0969-1
DOI :
10.1109/ISSCS.2007.4292770
