Information analysis for a large class of discrete sources

Daniela Tarniceriu,Valeriu Munteanu,Gheorghe Zaharia

doi:10.1109/isscs.2009.5206165

Information analysis for a large class of discrete sources

Daniela Tarniceriu, Valeriu Munteanu + Show 1 more

https://doi.org/10.1109/isscs.2009.5206165

Copy DOI

Publication Date: Jul 1, 2009

Citations: 6

Affiliation: Gheorghe Asachi Technical University of Iași, Institut National des Sciences Appliquées de Rennes, French National Centre for Scientific Research, Institute of Electronics and Telecommunications of Rennes

#Minimum Average Code Word Length #Class Of Sources + Show 8 more

Abstract
Full-Text PDF
Similar Papers

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.

Full Text