Hi,
On Mon, 20 Nov 2000, Petr Vyhnak wrote:
> >I tried using some of the zlib functions, but none of them worked. There's
> >quite a number of custom functions that might help here, though
> >(I'm not really working on SCI1 anyway, except for a separate project).
Impressive! :-)
[...]
> 2. after the 2 bits follows the actual bitstream. you decode it as follows
> (P1 = 0 - binary ?):
[...]
> - if the bit is 1 we have here a length/distance pair:
> - decode a number with Hufmman Tree #1 (length tree);
> variable bit length, result is 0x00 .. 0x0F -> L1
Do you happen to know what that tree looks like?
> - decode another number with Hufmann Tree #2 (distance
> tree) giving result 0x00..0x3F -> D1
Same question... :->
Anyway, thanks a lot! This should make it possible to build a
portable clean-room implementation of the algorithm�(once we know what the
trees look like).
I guess it's time to update the docs this weekend...
llap,
Christoph
