CW tree alg applied recursively

[abocut]

Hello again,
thank you for the links.
I will do also the decompress.

I want to add 2 things:
- I still sustain this method and even the file will be compressed
lesser than 15MB, I have the courage to say that if this CW tree algo
will be used on that compressed file there will be some gained bytes
- if the algo is used for more times than: at the first run the gain
is around 34KB, than if the result file is renamed and executed again
the gain is around 30KB and at the 3rd execution 31KB so till now 95KB

PS>
- thanks for the links
- I will execute for at least 20times the algo and will let you know
about the results(somewhere it should be not ok)
- I will finalise the decompress

Thanks,
best regards,
Adrian,

[Matt Mahoney]

I suggest you get your decompresser to work first. If you think that
you can compress recursively, then you are wasting your time. See
http://mattmahoney.net/dc/dce.html#Section_11

[Attila Oláh]

Hello,

After reading part of your code, I was wondering about running a similar algorithm, maybe in a distributed environment. What is the license of your algorithm?

Attila