On the Analysis of Variable-to-Variable Length Codes

We use the "conservation of entropy" to simplify the formula for the redundancy of a large class of variable-to-variable length codes on discrete, memoryless sources. This results leads to new asymptotic upper bounds on the redundancy of the "Tunstall-Huffman" code and the "Tunstall-Shannon-Fano" code.