DocumentCode
2994760
Title
Information quantities attached to M-ary antiuniform Huffman codes
Author
Munteanu, Valeriu ; Tarniceriu, Daniela ; Zaharia, Gheorghe
Author_Institution
Fac. of Electron., Telecommun. & Inf. Technol., Tech. Univ. ´´Gheorghe Asachi´´ Iasi, Iasi, Romania
fYear
2009
fDate
9-10 July 2009
Firstpage
1
Lastpage
4
Abstract
In this paper M-ary antiuniform Huffman codes are considered. In this case the source probability distribution assures the minimum average codeword length, by diversifying only one node on each level in the tree graph. A matrix characterization of the M-ary antiuniform Huffman code as a source with memory is performed and the information quantities are derived.
Keywords
Huffman codes; matrix algebra; probability; M-ary antiuniform Huffman codes; codeword length; matrix characterization; source probability distribution; tree graph; Encoding; Entropy; Information technology; Memoryless systems; Mutual information; Probability distribution; Tree graphs;
fLanguage
English
Publisher
ieee
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
Type
conf
DOI
10.1109/ISSCS.2009.5206164
Filename
5206164
Link To Document