On the composition of Tunstall messages
Francesco Fabris, Andrea Sgarro · IEEE Transactions on Information Theory · 1999
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.