Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

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

by LanX (Archbishop)
on May 16, 2019 at 11:20 UTC ( #11100072=note: print w/replies, xml ) Need Help??


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

Thanks I'm free again! \○/

> Matched, compression ratio = 63.2%

Strange, that's 0.5% better than predicted. ;)

Cheers Rolf
(addicted to the Perl Programming Language :)
Wikisyntax for the Monastery FootballPerl is like chess, only without the dice

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

Replies are listed 'Best First'.
Re^10: Data compression by 50% + : is it possible?
by tybalt89 (Parson) on May 16, 2019 at 19:44 UTC

    That's for one run of 100 lines.

    For much larger runs it is around 62.8%

      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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others exploiting the Monastery: (5)
As of 2019-06-26 22:20 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Is there a future for codeless software?



    Results (111 votes). Check out past polls.

    Notices?