[140835] 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 (Marshall Eubanks)
Sat May 21 11:51:04 2011
From: Marshall Eubanks <tme@americafree.tv>
In-Reply-To: <8A2C0949-6815-49C1-B760-BBF931E9EDA9@liveops.com>
Date: Sat, 21 May 2011 11:50:53 -0400
To: Sudeep Khuraijam <skhuraijam@liveops.com>
Cc: "nanog@nanog.org" <nanog@nanog.org>
Errors-To: nanog-bounces+nanog.discuss=bloom-picayune.mit.edu@nanog.org
On May 20, 2011, at 5:16 PM, Sudeep Khuraijam wrote:
> I could not help but admire nanog in its full form ;) and I cannot =
resist anymore. Allow me to suggest the EPR paradox machine.
>=20
> The cost of regenerating unpredictable information is inefficient by =
orders of magnitude, but wait... isn't it what we are trying to solve?
>=20
> On May 20, 2011, at 1:32 PM, Paul Timmins wrote:
>=20
> 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.
>=20
> -- 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?
Yes, it will be as long or longer (on average), because you have to =
represent position XYZ in some fashion,=20
and send that representation to the decoder, and it can easily be longer =
than the original message. Suppose that it takes 20,000 bits to
represent XYZ. How have you saved bits ? Having XYZ be longer than the =
original message is just as likely as having it be shorter.=20
The same problem applies to the original suggestion. You will not (on =
average) save bits.=20
If typical messages are not totally random, you can compress by =
considering the nature of that non-randomness, and tailoring your =
compression accordingly. These schemes are using random strings / hashes =
=
=
for =
their compression, and thus will (on average) not save
bits even if a message is highly non-random.
Regards
Marshall
>=20
> 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.
>=20
>=20
> ____________________________________________
> Sudeep Khuraijam | Netops | liveops | Office 408 8442511 | Mobile 408 =
666 9987
> skhuraijam@liveops.com<mailto:skhuraijam@liveops.com> | aim: =
skhuraijam
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
>=20
