[140826] in North American Network Operators' Group
Re: Had an idea - looking for a math buff to tell me if it's
daemon@ATHENA.MIT.EDU (Paul Timmins)
Fri May 20 16:32:48 2011
Date: Fri, 20 May 2011 16:32:00 -0400
From: Paul Timmins <paul@telcodata.us>
To: Paul Graydon <paul@paulgraydon.co.uk>
In-Reply-To: <4DD6C263.6030808@paulgraydon.co.uk>
Cc: nanog@nanog.org
Errors-To: nanog-bounces+nanog.discuss=bloom-picayune.mit.edu@nanog.org
On 05/20/2011 03:34 PM, Paul Graydon wrote:
> On 05/20/2011 08:53 AM, Brett Frankenberger wrote:
>> Even if those problems were solved, you'd need (on average) just as
>> many bits to represent which digit of pi to start with as you'd need to
>> represent the original message.
>>
>> -- Brett
> Not quite sure I follow that. "Start at position xyz, carry on for
> 10000 bits" shouldn't be as long as telling it all 10000 bits?
Currently we have a compression algorithm for doing this already in
widespread use. We create a list of numbers ranging from 1 to 255 and
then provide an index into that array. We save space by assuming it's a
single character.
