1996-03-04 - Re: Is there any work on entropy-lowering schemes?

Header Data

From: Andy Brown <a.brown@nexor.co.uk>
To: cypherpunks@toad.com
Message Hash: 41803fb6499dbd8b1d4378bae3d9b794962f5d8b84c97016721363c43a4e2ede
Message ID: <313AD43B.4A68@nexor.co.uk>
Reply To: <199603040206.SAA07584@ix14.ix.netcom.com>
UTC Datetime: 1996-03-04 12:06:19 UTC
Raw Date: Mon, 4 Mar 1996 20:06:19 +0800

Raw message

From: Andy Brown <a.brown@nexor.co.uk>
Date: Mon, 4 Mar 1996 20:06:19 +0800
To: cypherpunks@toad.com
Subject: Re: Is there any work on entropy-lowering schemes?
In-Reply-To: <199603040206.SAA07584@ix14.ix.netcom.com>
Message-ID: <313AD43B.4A68@nexor.co.uk>
MIME-Version: 1.0
Content-Type: text/plain


Bill Stewart wrote:
 
> Peter Wayner's work on Mimic Functions does just this sort of thing.
> You can describe a grammar, feed it random bits, and generate output that
> has the right statistics and can be reversed to get the original bits.
> His paper was on cs.cornell.edu a few years ago; don't know where
> to find it now.

If anyone finds out where Mimic has moved to I'd be very interested.

Thanks,

- Andy





Thread