Jump to content
  • Advertisement
Sign in to follow this  
DevFred

degenerate dynamic huffman tree

This topic is 3797 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

What is the maximum number of transitions from a leaf to the root in a dynamic huffman tree in the worst case when I call update at most 65,280 times? This text leads me to believe it is 25 since fib(26) = 75,025 is the lowest fibonacci number above 65,280. It would be great if someone could confirm this because 25 fits nice into a single integer and it would make my BitStack implementation a lot simpler than it currently is.

Share this post


Link to post
Share on other sites
Advertisement
I'm not sure of the terminology you are using.. but I am well versed in huffman encoders.

Your worst-case tree depth is indeed 25.

You might want to check out http://coding.derkeiler.com/Archive/General/comp.theory/2004-09/0431.html

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!