DocumentCode
1522574
Title
On the composition of Tunstall messages
Author
Fabris, Francesco ; Sgarro, Andrea
Author_Institution
Dipt. di Matematica e Inf., Udine Univ., Italy
Volume
45
Issue
5
fYear
1999
fDate
7/1/1999 12:00:00 AM
Firstpage
1608
Lastpage
1612
Abstract
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
Keywords
block codes; error statistics; source coding; variable length codes; Tunstall code; Tunstall messages; block length source codes; composition; encoding tree; error probability; large numbers law; skewness; variable-length source codes; Codes; Computational modeling; Distributed computing; Encoding; Entropy; Error probability; Testing; Very large scale integration;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.771230
Filename
771230
Link To Document