We prove that Huffman codes are optimal. In part 6, we complete the proof by induction. A playlist of these videos is available at: • Information Theory
A little technicality. To make sure "any" Huffman code for case k=2 is optimal we need to mention that the only Huffman codes in that case are "0,1" and "1,0." I have never posted on your content before, but it is amazing! Thank you a lot!
I would have said that Huffman codes were optimal, because of the way they are constructed. Namely the longest codes get assigned to those which are least frequent.
A little technicality. To make sure "any" Huffman code for case k=2 is optimal we need to mention that the only Huffman codes in that case are "0,1" and "1,0."
I have never posted on your content before, but it is amazing! Thank you a lot!
I would have said that Huffman codes were optimal, because of the way they are constructed. Namely the longest codes get assigned to those which are least frequent.