Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!nntp.club.cc.cmu.edu!micro-heart-of-gold.mit.edu!bloom-beacon.mit.edu!panix!not-for-mail From: Grant Edwards Newsgroups: comp.lang.python Subject: Re: Algorithm that makes maximum compression of completly diffused data. Date: Wed, 30 Oct 2013 21:18:36 +0000 (UTC) Organization: PANIX Public Access Internet and UNIX, NYC Lines: 21 Message-ID: References: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> NNTP-Posting-Host: dsl.comtrol.com X-Trace: reader1.panix.com 1383167916 15389 64.122.56.22 (30 Oct 2013 21:18:36 GMT) X-Complaints-To: abuse@panix.com NNTP-Posting-Date: Wed, 30 Oct 2013 21:18:36 +0000 (UTC) User-Agent: slrn/1.0.1 (Linux) Xref: csiph.com comp.lang.python:58122 On 2013-10-30, jonas.thornvall@gmail.com wrote: > I am searching for the program or algorithm that makes the best > possible of completly (diffused data/random noise) and wonder what > the state of art compression is. [...] > It is of course lossless compression i am speaking of. For completely random noise, the CAT compression algorithm will acheive the maximum theoretical result. It's been available on Unix systems for decades via the "cat" command. It's also trivial to implement in your own code if you desire. -- Grant Edwards grant.b.edwards Yow! I put aside my copy at of "BOWLING WORLD" and gmail.com think about GUN CONTROL legislation...