Variable-length-to-variable length source coding: a greedy step-by-step algorithm

Some results on variable-length-to-variable-length source coding are presented. A sufficient criterion for the asymptotic optimality of the generic V-V code is given. This also allows the study of the Tunstall-Huffman scheme performance. Then, a nonoptimal greedy approach to prefix codes is describe... View More