On the analysis of variable-to-variable length codes
Serap A. Savari, Wojciech Szpankowski · 2003
We use the "conservation of entropy" [1] to simplify the formula for the redundancy of a large class of variable-to-variable length codes on discrete, memoryless sources. This result leads to new asymptotic upper bounds on the redundancy of the "Tunstall-Huffman" code and the "Tunstall-Shannon-Fano" code.