DocumentCode
2994794
Title
Information analysis for a large class of discrete sources
Author
Tarniceriu, Daniela ; Munteanu, Valeriu ; Zaharia, Gheorghe
Author_Institution
Fac. of Electron., Telecommun. & Inf. Technol., Tech. Univ. Gheorghe Asachi, Iasi, Romania
fYear
2009
fDate
9-10 July 2009
Firstpage
1
Lastpage
4
Abstract
In this paper an information analysis for lossless compression of a large class of discrete sources is performed. The lossless compression is performed by means of a Huffman code with an alphabet A of size M. Matrix characterization of the encoding as a source with memory is realized. The information quantities H(S,A), H(S), H(A), H(A|S), H(S|A), I(S,A) as well as the minimum average code word length are derived. Three extreme cases, p = M-1, p = 0 and M = 2, p = 1 have been analyzed.
Keywords
Huffman codes; matrix algebra; Huffman code; codeword length; discrete sources; encoding; information analysis; information quantities; lossless compression; matrix characterization; Encoding; Entropy; Information analysis; Information technology; 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.5206165
Filename
5206165
Link To Document