(IC 4.10) Optimality of Huffman codes (part 5) - extension lemma

Описание: We prove that Huffman codes are optimal. In part 5, we show that the H-extension of an optimal code is optimal.


A playlist of these videos is available at:
   • Information Theory