Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

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

by LanX (Archbishop)
on May 17, 2019 at 13:31 UTC ( #11100171=note: print w/replies, xml ) Need Help??


in reply to Re^10: Data compression by 50% + : is it possible?
in thread Data compression by 50% + : is it possible?

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

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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://11100171]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others having an uproarious good time at the Monastery: (8)
As of 2019-06-24 19:19 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Is there a future for codeless software?



    Results (99 votes). Check out past polls.

    Notices?