Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

it is well known that Huffman code with minimum variance is preferable. I've digged through entire Polish/English internet and this is what I found: to build Huffman code with minimum variance you need to break ties with one of the following methods (of course probability of node is the most important):

  • Select node that represents shortest tree
  • Select node that was created earliest (consider leafs as created at start).

the problem is, that I couldn't find any proof of correctness of any of these methods. Can someone proof any of these?

I will gladly clarify anything.

share|improve this question
    
Does proof-by-experience count as a proof? –  Jan Dvorak Feb 3 '13 at 22:36
    
Nope. I need a legit proof. –  Piotr Jaszkowski Feb 4 '13 at 0:46
add comment

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.