Compression - Getting Huffman tree height without performing Huffman algorithm? (Was: Generating Hu

You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

Author

Getting Huffman tree height without performing Huffman algorithm? (Was: Generating Hu

Alex Vinokur

2004-09-30, 3:55 pm

"Kenneth Almquist" <ka@sorry.no.email> wrote in message news:zk56d.16293$M45.7358@trndny09...
> The standard algorithm for generating Huffman codes assumes that
> the codes can be arbitrarily long. Is there an efficient algorithm
> to generate an optimal set of codes subject to the constraint that
> no code can be longer than a specified length?
>
[snip]

A new question related to the question above:
Is it possible to get maximum/minimum height of Huffman tree (for any set of weights) without performing Huffman algorithm?

--
Alex Vinokur
http://mathforum.org/library/view/10978.html
http://sourceforge.net/users/alexvn

Sponsored Links