|
|
 | | From: | Scout | | Subject: | Huffman codeword lengths | | Date: | Wed, 05 Jan 2005 22:26:21 GMT |
|
|
 | Hi All,
just a question for you:
Let's assume
l(i)
where p(i) is the probability of the i-th element in a list
and l(i) is the length of the codeword associated to the i-th symbol.
Now, why [[Equation1]] cannot be guaranteed with Huffman's algorithm?
Thanks,
~Scout~
|
|
|
