Re^10: Data compression by 50% + : is it possible?

That's for one run of 100 lines.

For much larger runs it is around 62.8%

Comment on Re^10: Data compression by 50% + : is it possible?

Replies are listed 'Best First'.
Re^11: Data compression by 50% + : is it possible? by LanX (Saint) on May 17, 2019 at 13:31 UTC
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 _{(addicted to the Perl Programming Language :) Wikisyntax for the Monastery FootballPerl is like chess, only without the dice}	[reply]

Replies are listed 'Best First'.

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
_{(addicted to the Perl Programming Language :)

Wikisyntax for the Monastery
FootballPerl is like chess, only without the dice}