Information quantities attached to M-ary antiuniform Huffman codes

Information quantities attached to M-ary antiuniform Huffman codes

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

Ausführliche Beschreibung

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