Hi,
On Mon, 20 Nov 2000, Petr Vyhnak wrote:
> BTW I have tried to implement it and it seems that it works.
Great! :-)
(Still, we'd better use a clean-room implementation from someone who has
just seen the abstract description of the algorithm).
> here are the trees (the root of the tree is in the right, not in the left !):
> -----------------------------------------------------------
>
> Tree 1
> ----------------
> 00 010
> 01 11
> 02 001
...
(No further entries starting with 1 follow)
This is not a Huffman tree:
/\
1 0
/ \
/\
1 0
[00] \
/\
0 1
[01] ?
Are you certain the code for 02 isn't just 01?
Thanks a lot, though! :-)
llap,
Christoph
