Algorithm that makes maximum compression of completly diffused data.
Dan Stromberg
drsalists at gmail.com
Wed Oct 30 15:29:35 EDT 2013
More information about the Python-list mailing list
Wed Oct 30 15:29:35 EDT 2013
- Previous message (by thread): Algorithm that makes maximum compression of completly diffused data.
- Next message (by thread): Algorithm that makes maximum compression of completly diffused data.
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
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, <jonas.thornvall at 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. > > 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 > -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://mail.python.org/pipermail/python-list/attachments/20131030/c20ffb66/attachment.html>
- Previous message (by thread): Algorithm that makes maximum compression of completly diffused data.
- Next message (by thread): Algorithm that makes maximum compression of completly diffused data.
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Python-list mailing list