I just realized that we had the same ideas (me just later ;).
One difference is that you want to encode each of the 9 groups individually with 6 bits each => 6*9=54 bits per line while I'm encoding a whole line as a polynom
Sum($g($i) * 50**$i) with $i=0 .. 8
resulting in the need of 51 bits per line.
But I don't understand why you say
> That's not quite enough to crunch out half the space
The old encoding needs per line in average >14 bytes plus newline.
That's > 15 * 8 = 120 bits
So your 54 bits need already less than half the space!
What am I missing?
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice
In reply to Re^2: Data compression by 50% + : is it possible?
by LanX
in thread Data compression by 50% + : is it possible?
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |