Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

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

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

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

Great! :)

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

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (9)
As of 2019-06-18 15:08 GMT
Find Nodes?
    Voting Booth?
    Is there a future for codeless software?

    Results (82 votes). Check out past polls.

    • (Sep 10, 2018 at 22:53 UTC) Welcome new users!