On the composition of Tunstall messages

On the composition of Tunstall messages

We study the composition of messages in an encoding tree for a Tunstall code, and, more generally, in a tree whose skewness is bounded. For such trees a sort of "law of large numbers" holds true; actually, we provide a direct and converse coding theorem for variable-length to block length...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 1999-07, Vol.45 (5), p.1608-1612
Hauptverfasser: Fabris, F., Sgarro, A.
Format: Artikel
Sprache:eng
Schlagworte:
Computer science
Theory
Variable length codes
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the composition of messages in an encoding tree for a Tunstall code, and, more generally, in a tree whose skewness is bounded. For such trees a sort of "law of large numbers" holds true; actually, we provide a direct and converse coding theorem for variable-length to block length source codes, when a vanishing error probability is allowed.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.771230