Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

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

by LanX (Archbishop)
on May 14, 2019 at 03:09 UTC ( #1233744=note: print w/replies, xml ) Need Help??


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

> My advice would be that there is always the potential to compress. Even in random sequences you will get repeated patterns. The difficulty is finding those patterns. You want a pattern that is easy to find first.

That's drivel, you can only compress independent information without loss as long as density allows.

A bit will never encode 3 states.

update

> Do people understand what I am saying?

no

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

  • Comment on Re^2: 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://1233744]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (3)
As of 2019-06-16 05:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Is there a future for codeless software?



    Results (76 votes). Check out past polls.

    Notices?