Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!casbah.acns.nwu.edu!ftpbox!mothost!motcid!beville
From: beville@motcid.UUCP (Anthony T. Beville)
Newsgroups: comp.compression
Subject: Number theory compression ?
Message-ID: <4931@pink1.UUCP>
Date: 8 Apr 91 14:35:01 GMT
References: <1991Apr4.150053.29873@linus.mitre.org> <1991Apr5.064220.18509@dde.dk>   <1991Apr6.080615.23197@zorch.SF-Bay.ORG> <28185:Apr700:26:0491@kramden.acf.nyu.edu> <1991Apr7.020617.12261@nntp-server.caltech.edu> <5351@ns-mx.uiowa.edu>
Organization: Motorola Inc., Cellular Infrastructure Div., Arlington Heights, IL
Lines: 34

drenze@umaxc.weeg.uiowa.edu (Douglas Renze) writes:

>In article <1991Apr7.020617.12261@nntp-server.caltech.edu> toddpw@nntp-server.caltech.edu (Todd P. Whitesel) writes:
>>Has anybody tried developing a compression or encryption scheme that uses the
>>digits or bits of an irrational number as a key or pseudorandom generator?

I have been pondering just this idea for quite some time, but
have never seriously investigated it.  

It seems to me that a scheme using the the digits of
and irrational number ( or a repeating rational number, for that
matter) might be able to yeild some really good compression
ratios.  

For any given sequence of bits longer than some number,  
merely (!) find a matching sequence deep within the bowels 
of pi or sqrt(2) or some fraction or whatever, and represent
that sequence with a greatly reduced number of bits.  

The compression would have to be a very time-consuming process,
and would yield varied results depending upon how much time was 
spent.

The decompression, however, would probably be a snap.

Has anyone done anything like this?  I would really like
to see some ideas on this topic!


-- 
| Tony Beville                          |Motorola Inc.              |
| Phone: (708) 632-6622                 |1501 W. Shure Drive        |
| uunet!{motcid,mcdchg}!beville         |Arlington Heights,IL 60004 |
| {motcid,mcdchg}!beville@uunet.uu.net  |Mail Stop: IL27-1252       |