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, se provide a direct and converse coding theorem for variable-length to block-length source codes, when a vanishing error probability is allowed.
tunstall codes law of large numbers message composition typical sequences