Is it true to say that Huffman codes always satisfy Kraft’s inequality with strict equality?
At first, I thought the statement is wrong since for Huffman coding there is no assumptions on the probabilities. However, when I tried evaluation the Kraft inequality for several Huffman codes, I realized that it’s got nothing to do with the probabilities. It’s the algorithm.
I looked for a nice mathematical proof for this, but couldn’t find any. Would appreciate your help.