Asymptotics of greedy algorithms for variable-to-fixed length coding of Markov sources

In this paper, alphabet extension for Markov sources is studied such that each extension tree is grown by splitting the node with the maximum value for a weight as a generalization of the leaf probability in Tunstall´s (1967) algorithm. We show that the optimal asymptotic rate of convergence of the per-symbol code length to the entropy does not depend on an a priori selected proportional allocation of the sizes of the extension trees at the states. We show this without imposing restrictive conditions on the weight by which the trees are extended. Further, we prove the asymptotic optimality of an algorithm that allocates an increasing total number of leaves among the states. Finally, we give exact formulas for all the relevant quantities of the trees grown