Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!feeder2.news.elisa.fi!newsfeed3.funet.fi!newsfeeds.funet.fi!uio.no!news.tele.dk!news.tele.dk!small.news.tele.dk!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.067 X-Spam-Evidence: '*H*': 0.87; '*S*': 0.00; 'algorithm': 0.04; 'slow.': 0.09; 'chunks': 0.16; 'compression': 0.16; 'to:name:python list': 0.16; 'url:py': 0.16; 'url:svn': 0.16; 'ways:': 0.16; 'wrote:': 0.18; 'wed,': 0.18; 'bit': 0.19; 'module': 0.19; 'email addr:gmail.com>': 0.22; 'of.': 0.24; 'question': 0.24; 'header :In-Reply-To:1': 0.27; 'to:2**1': 0.27; 'correct': 0.29; 'am,': 0.29; 'wonder': 0.29; 'needed.': 0.30; 'message- id:@mail.gmail.com': 0.30; 'url:mailman': 0.30; 'ctypes': 0.31; 'subject:that': 0.31; 'url:python': 0.33; 'but': 0.35; 'received:google.com': 0.35; 'really': 0.36; 'url:listinfo': 0.36; 'possible': 0.36; 'url:org': 0.36; 'should': 0.36; 'searching': 0.37; 'turn': 0.37; 'version,': 0.38; 'handle': 0.38; 'to:addr :python-list': 0.38; 'little': 0.38; 'does': 0.39; 'to:addr:python.org': 0.39; 'url:mail': 0.40; 'is.': 0.60; 'forum': 0.61; 'course': 0.61; 'such': 0.63; 'different': 0.65; '30,': 0.65; 'relatively': 0.65; 'to:addr:gmail.com': 0.65; 'completly': 0.84; 'good,': 0.91; '2013': 0.98 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:date:message-id:subject:from:to :content-type; bh=gUPNmu8x0D8LGJHPJ2B+a4SEanYKozReWt0NMis22xg=; b=OuiQKBED3rLcLNUE/as14naywU4KZKx3sCaVRHiQhMxd4XqEAuOWbsuq/XsOCDBU3g uDJAhmjlYREzT0+zlhdCOPjhRo0e4FNOeBGIgvJBrHbOT9AWfkHcyplmqe2LkZvoGftK i62Gjyh/w7wxuTKj2PcV1ypVqsN3bEIfOl1bZg/xxHBYIgu4Jw/T24j5DRAC42Jomx5M bq/eLInXXgIuWg5Z8WZtFuMBDFefn0Mbxb2H3Z1NdBr/RYDC0pue+KQBqB1t/paEsJ1q 210H/NW5bV9apwqyLSLguHd2HLYOahFE2DgaJfkafvz8Ks0Ww5Wr2KqAABL3KUIXPq8V sOvA== MIME-Version: 1.0 X-Received: by 10.180.36.139 with SMTP id q11mr3679431wij.0.1383161375253; Wed, 30 Oct 2013 12:29:35 -0700 (PDT) In-Reply-To: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> References: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> Date: Wed, 30 Oct 2013 12:29:35 -0700 Subject: Re: Algorithm that makes maximum compression of completly diffused data. From: Dan Stromberg To: jonas.thornvall@gmail.com, Python List Content-Type: multipart/alternative; boundary=e89a8f502c4c70687e04e9fa5a7e X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: General discussion list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 62 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1383161383 news.xs4all.nl 15962 [2001:888:2000:d::a6]:41413 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:58095 --e89a8f502c4c70687e04e9fa5a7e Content-Type: text/plain; charset=ISO-8859-1 xz compression is pretty hard, if a little bit slow. Also, if you want really stellar compression ratios and you don't care about time to compress, you might check out one of the many paq implementations. I have a module that does xz compression in 4 different ways: http://stromberg.dnsalias.org/svn/backshift/tags/1.20/xz_mod.py It's only for smallish chunks in the ctypes version, because that was all I needed. The others should be able to handle relatively large inputs. On Wed, Oct 30, 2013 at 11:21 AM, 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. > > I understand this is not the correct forum but since i think i have an > algorithm that can do this very good, and do not know where to turn for > such question i was thinking to start here. > > It is of course lossless compression i am speaking of. > -- > https://mail.python.org/mailman/listinfo/python-list > --e89a8f502c4c70687e04e9fa5a7e Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable

xz compression is pretty hard, if a li= ttle bit slow.=A0 Also, if you want really stellar compression ratios and y= ou don't care about time to compress, you might check out one of the ma= ny paq implementations.

I have a module that does xz compression in 4 different ways:
http:= //stromberg.dnsalias.org/svn/backshift/tags/1.20/xz_mod.py
It&= #39;s only for smallish chunks in the ctypes version, because that was all = I needed.=A0 The others should be able to handle relatively large inputs.

On Wed,= Oct 30, 2013 at 11:21 AM, <jonas.thornvall@gmail.com> wrote:
I am searching for the pr= ogram or algorithm that makes the best possible of completly (diffused data= /random noise) and wonder what the state of art compression is.

I understand this is not the correct forum but since i think i have an algo= rithm that can do this very good, and do not know where to turn for such qu= estion i was thinking to start here.

It is of course lossless compression i am speaking of.
--
https://mail.python.org/mailman/listinfo/python-list

--e89a8f502c4c70687e04e9fa5a7e--