Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes - Part 1

Tight bounds on the codeword lengths and average codeword length for D-ary Huffman codes - Part 1

This paper presents new results of the D-ary Huffman tree. These results are used to prove that the maximum value of the average codeword length is obtained for the uniform distribution. The upper bound computed in this paper is higher than the value obtained for Huffman codes with minimum redundanc...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Zaharia, G., Munteanu, V., Tarniceriu, D.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Data compression
Encoding
Huffman coding
Information technology
Probability distribution
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents new results of the D-ary Huffman tree. These results are used to prove that the maximum value of the average codeword length is obtained for the uniform distribution. The upper bound computed in this paper is higher than the value obtained for Huffman codes with minimum redundancy.
DOI:10.1109/ISSCS.2009.5206161