Information analysis for a large class of discrete sources

Information analysis for a large class of discrete sources

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 informatio...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Tarniceriu, D., Munteanu, V., Zaharia, G.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Encoding
Entropy
Information analysis
Information technology
Tree graphs
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/ISSCS.2009.5206165