Re: Compression of random binary data

Path	csiph.com!feeder.erje.net!1.us.feeder.erje.net!newsfeed.fsmpi.rwth-aachen.de!newsfeed.straub-nv.de!news-1.dfn.de!news.dfn.de!news.informatik.hu-berlin.de!fu-berlin.de!uni-berlin.de!not-for-mail
From	Michael Torrie <torriem@gmail.com>
Newsgroups	comp.lang.python
Subject	Re: Compression of random binary data
Date	Tue, 12 Jul 2016 12:20:21 -0600
Lines	23
Message-ID	<mailman.18.1468347627.21009.python-list@python.org> (permalink)
References	<d6053eeb-bb1b-49d7-95e2-9f15028746e5@googlegroups.com> <f8d5ef2f-697c-49cd-b039-4a8148b7dda3@googlegroups.com> <ae98eb6f-fa9a-401a-ae5f-617804216673@googlegroups.com> <57850a15$0$1584$c3e8da3$5496439d@news.astraweb.com> <63c6d9ed-8944-4882-83eb-f7f2ce725033@googlegroups.com> <a2c5d9c8-d30a-412c-a182-a38c1d2b4197@gmail.com>
Mime-Version	1.0
Content-Type	text/plain; charset=utf-8
Content-Transfer-Encoding	7bit
X-Trace	news.uni-berlin.de 0TQ7r+2Dq/NrN2o2IAW2HQk3VrXVuwYWsEJSvib9kkYg==
Return-Path	<torriem+gmail@torriefamily.org>
X-Original-To	python-list@python.org
Delivered-To	python-list@mail.python.org
X-Spam-Status	OK 0.006
X-Spam-Evidence	'H': 0.99; 'S': 0.00; 'layers': 0.05; 'repeated': 0.07; 'closest': 0.09; 'patent': 0.09; 'subtract': 0.09; 'zero.': 0.09; 'fold': 0.16; 'folding': 0.16; 'from:addr:torriem': 0.16; 'from:name:michael torrie': 0.16; 'noble': 0.16; 'received:io': 0.16; 'received:psf.io': 0.16; 'subject:random': 0.16; 'wrote:': 0.16; 'math': 0.20; 'algorithm': 0.20; 'am,': 0.23; 'bigger': 0.23; 'second': 0.24; 'header:In-Reply-To:1': 0.24; 'header:User- Agent:1': 0.26; 'then.': 0.27; 'actual': 0.28; 'random': 0.29; 'message-id:@gmail.com': 0.34; 'quickly': 0.34; 'structure': 0.34; 'add': 0.34; 'could': 0.35; 'there': 0.36; 'smaller': 0.36; 'to:addr:python-list': 0.36; 'subject:: ': 0.37; 'say': 0.37; 'received:org': 0.37; 'difference': 0.38; 'enough': 0.39; 'received:192': 0.39; 'to:addr:python.org': 0.40; 'where': 0.40; 'close': 0.61; 'suitable': 0.61; 'email addr:gmail.com': 0.62; 'our': 0.64; 'between': 0.65; 'sum': 0.69; 'prize': 0.79
X-Virus-Scanned	amavisd-new at torriefamily.org
User-Agent	Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101 Thunderbird/45.1.1
In-Reply-To	<63c6d9ed-8944-4882-83eb-f7f2ce725033@googlegroups.com>
X-BeenThere	python-list@python.org
X-Mailman-Version	2.1.22
Precedence	list
List-Id	General discussion list for the Python programming language <python-list.python.org>
List-Unsubscribe	<https://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe>
List-Archive	<http://mail.python.org/pipermail/python-list/>
List-Post	<mailto:python-list@python.org>
List-Help	<mailto:python-list-request@python.org?subject=help>
List-Subscribe	<https://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe>
X-Mailman-Original-Message-ID	<a2c5d9c8-d30a-412c-a182-a38c1d2b4197@gmail.com>
X-Mailman-Original-References	<d6053eeb-bb1b-49d7-95e2-9f15028746e5@googlegroups.com> <f8d5ef2f-697c-49cd-b039-4a8148b7dda3@googlegroups.com> <ae98eb6f-fa9a-401a-ae5f-617804216673@googlegroups.com> <57850a15$0$1584$c3e8da3$5496439d@news.astraweb.com> <63c6d9ed-8944-4882-83eb-f7f2ce725033@googlegroups.com>
Xref	csiph.com comp.lang.python:111347

Show key headers only | View raw

On 07/12/2016 11:46 AM, jonas.thornvall@gmail.com wrote:
> Well the algorithm start with looking up a suitable folding structure
> "close enough to the number", then it works down the folding
> structure finding the fold where the difference or sum between the
> folds closest to zero.
> 
> You do the same prinicple with the remainder until zero is achieved.
> 
> So our first fold can either be bigger or smaller, and it seek a
> configuration for the fold that close in max on the actual random
> number. The second fold could be a fold that depending upon our first
> fold was bigger or smaller than number either will add or subtract
> lower layers of the fold.
> 
> There will come out a difference that need to be folded, the process
> is repeated until there is nothing to fold.
> 
> It is basicly a search algorithm looking for suitable folding
> structures.

Better patent it quickly then.  And you will win a noble prize for math
if you could do what you say you could.

Thread

Compression of random binary data jonas.thornvall@gmail.com - 2016-07-11 10:52 -0700
  Re: Compression of random binary data Joonas Liik <liik.joonas@gmail.com> - 2016-07-11 21:09 +0300
    Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-11 11:24 -0700
      Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-11 11:32 -0700
  Re: Compression of random binary data MRAB <python@mrabarnett.plus.com> - 2016-07-11 19:30 +0100
  Re: Compression of random binary data Steven D'Aprano <steve@pearwood.info> - 2016-07-12 04:38 +1000
    Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 07:24 -0700
      Re: Compression of random binary data Steven D'Aprano <steve@pearwood.info> - 2016-07-13 01:11 +1000
        Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 10:35 -0700
          Re: Compression of random binary data Ian Kelly <ian.g.kelly@gmail.com> - 2016-07-12 16:23 -0600
            Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 17:43 -0700
            Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 17:47 -0700
          Re: Compression of random binary data Steven D'Aprano <steve@pearwood.info> - 2016-07-13 12:29 +1000
            Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-13 02:46 -0700
              Re: Compression of random binary data Steven D'Aprano <steve@pearwood.info> - 2016-07-13 23:11 +1000
              Re: [OT] Compression of random binary data Michael Torrie <torriem@gmail.com> - 2016-07-13 13:03 -0600
                Re: [OT] Compression of random binary data Marko Rauhamaa <marko@pacujo.net> - 2016-07-13 22:35 +0300
                Re: [OT] Compression of random binary data Tim Delaney <timothy.c.delaney@gmail.com> - 2016-07-14 08:39 +1000
              Re: [OT] Compression of random binary data Grant Edwards <grant.b.edwards@gmail.com> - 2016-07-13 19:34 +0000
            Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-13 03:04 -0700
              Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-13 03:14 -0700
              Re: Compression of random binary data Steven D'Aprano <steve@pearwood.info> - 2016-07-13 22:13 +1000
  Re: Compression of random binary data Nobody <nobody@nowhere.invalid> - 2016-07-11 19:56 +0100
  Re: Compression of random binary data MRAB <python@mrabarnett.plus.com> - 2016-07-11 19:57 +0100
  Re: Compression of random binary data Terry Reedy <tjreedy@udel.edu> - 2016-07-11 15:31 -0400
  Re: Compression of random binary data Michael Selik <michael.selik@gmail.com> - 2016-07-12 00:36 +0000
  Re: Compression of random binary data Lawrence D’Oliveiro <lawrencedo99@gmail.com> - 2016-07-11 20:01 -0700
    Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 07:29 -0700
      Re: Compression of random binary data Steven D'Aprano <steve@pearwood.info> - 2016-07-13 01:17 +1000
        Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 10:46 -0700
          Re: Compression of random binary data Michael Torrie <torriem@gmail.com> - 2016-07-12 12:20 -0600
            Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 12:31 -0700
            Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 12:40 -0700
              Re: Compression of random binary data jonas.thornvall@gmail.com - 2016-07-12 12:42 -0700
      Re: Compression of random binary data mm0fmf <none@invalid.com> - 2016-07-12 17:32 +0100

csiph-web