Oh I see, but I hope you are aware that your approach can easily be packed into 9*6=54 bits and is easier to code than mine.
With a per line ratio of 7 bytes = 56 bits you'll already have a 50%+ compression.
My approach would require modulo 50 calculations on 51 bit integers, not sure how tricky this is on a 32 bit machine.
So I'd rather "waste" 5 bits/line for a pragmatic solution.
Btw: I'm reluctant trying to implement Huffman here, because the OP could probably change the parameters in his next post.
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice
In reply to Re^4: Data compression by 50% + : is it possible?
by LanX
in thread Data compression by 50% + : is it possible?
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |