Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
Re^11: Data compression by 50% + : is it possible?by LanX (Saint) |
on May 17, 2019 at 13:31 UTC ( [id://11100171]=note: print w/replies, xml ) | Need Help?? |
FWIW I created a Huffman code for 50**2 pairs to improve the compression. (So called "blocking" ) It only saved something like 1% of the average code length, which seems to indicate that the code is already very close to the optimal entropy limit. See German-WP for theoretical background.
Cheers Rolf
In Section
Seekers of Perl Wisdom
|
|