FWIW Compress::Huffman looks promising.
It seems to take a frequency table as input (actually probability, so divide my table by 10000) and to store it together with a bit string and decode it again.
On a side note:
You might want to experiment with changed weights, that is multiply the frequency with the length of the key, like 246 with 3 and recalculate the proportions.
This could give you a better compression compared to the old format because there you need 3 characters for this entry.
(I'm not sure here, it's mind boggling)
Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice
In reply to Re^3: Data compression by 50% + : is it possible?
by LanX
in thread Data compression by 50% + : is it possible?
by baxy77bax
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |