Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels

Bounds on Codeword Lengths of Optimal Codes for Noiseless Channels

For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of Huffman encoding, we derive the upper and lower bounds of average codeword length.

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Munteanu, V., Tarniceriu, D.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
average codeword length
Distributed computing
Electronic mail
Encoding
Entropy
Huffman coding
Lagrangian functions
Length measurement
Probability distribution
Time measurement
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:For the case in which the code alphabet consists of M letters, we derive the optimum probability distribution of a discrete source that assures the minimum average codeword length. For the case of Huffman encoding, we derive the upper and lower bounds of average codeword length.
DOI:10.1109/ISSCS.2007.4292770