On the analysis of variable-to-variable length codes

Abstract

We simplify the formula for the redundancy of a large class of variable-to-variable length codes on discrete, memoryless sources and find new asymptotic upper bounds on the redundancy of the Tunstall-Huffman code and the Tunstall-Shannon-Fano code.