Algorithm that makes maximum compression of completly diffused data.

jonas.thornvall at gmail.com jonas.thornvall at gmail.com
Fri Nov 8 03:05:55 CET 2013


Den torsdagen den 7:e november 2013 kl. 23:26:45 UTC+1 skrev Chris Angelico:
> On Fri, Nov 8, 2013 at 5:59 AM, Mark Janssen <dreamingforward at gmail.com> wrote:
> 
> > I think the idea is that you could take any arbitrary input sequence,
> 
> > view it as a large number, and then find what exponential equation can
> 
> > produce that result.  The equation becomes the "compression".
> 
> 
> 
> Interesting idea, but I don't see how this has anything to do with
> 
> compressing arbitrary data. We already have a compact notation for
> 
> representing a large number as 2^24*x+2^16*y+2^8*z+q, so I don't see
> 
> how this will be any better, other than eliding NULs.
> 
> 
> 
> ChrisA

I guess what matter is how fast an algorithm can encode and decode a big number, at least if you want to use it for very big sets of random data, or losless video compression?



More information about the Python-list mailing list