Had an idea - looking for a math buff to tell me if it's possible?with today's technology.

Paul Timmins paul at telcodata.us
Fri May 20 20:32:00 UTC 2011

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.

More information about the NANOG mailing list