<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
</head>
<body bgcolor="#ffffff" text="#000000">
Cary Fitch wrote:
<blockquote id="mid_26D6B8BF82FC412686178B80A0A55B4E_Cary"
cite="mid:26D6B8BF82FC412686178B80A0A55B4E@Cary" type="cite">
<pre wrap="">It uses proprietary EDC. (Extreme Data Compression) The 140 bytes at 8
bits each, and that is 2^140^8, a nearly inexhaustible key number which is
related to audio and video data simultaneously stored on a Google Database,
which is then sent to the user.
Thus with the 140 byte message, full audio and video can be retrieved.
This is an outgrowth of the data compression program circa about 1992, when
disks were much smaller than today. A very small compression program would
infinitely compress data on a disk to allow storage of more data. It was
only a 200 bytes or so in size (DOS days):-) and worked perfectly. Running
it once resulted in lots of storage space. It took very little time. Of
course rewriting the MBR (Master Boot Record) takes very little time.
Recovering the "compressed" data was tough though.
Cary Fitch
04/01/09
-----Original Message-----
From: <a class="moz-txt-link-abbreviated" href="mailto:asterisk-users-bounces@lists.digium.com">asterisk-users-bounces@lists.digium.com</a>
[<a class="moz-txt-link-freetext" href="mailto:asterisk-users-bounces@lists.digium.com">mailto:asterisk-users-bounces@lists.digium.com</a>] On Behalf Of Tzafrir Cohen
Sent: Wednesday, April 01, 2009 11:09 AM
To: <a class="moz-txt-link-abbreviated" href="mailto:asterisk-users@lists.digium.com">asterisk-users@lists.digium.com</a>
Subject: Re: [asterisk-users] FOR IMMEDIATE RELEASE: NEW CHANNEL
DRIVERFORASTERISK RELEASED TODAY
On Wed, Apr 01, 2009 at 06:52:55PM +0300, Dovid Bender wrote:
</pre>
<blockquote id="StationeryCiteGenerated_1" type="cite">
<pre wrap="">I wish we could have this for real....
</pre>
</blockquote>
<pre wrap=""><!---->
Micro-video-blogging: Limited to 140B ?
</pre>
</blockquote>
<br>
I thought maybe it used Infinite Monkey Compression where a mathematic
equation whose output over a specified domain would recreate the
data-bits. For those unfamiliar with Infinite Monkey Compression it
was theorized by me a few years ago as an offshoot of Infinite Monkey
Theorem (monkeys, typewriters Shakespeare, etc...). The original
theory was that is an infinite number of monkeys could eventually type
the complete works of Shakespeare through random coincidence then a
random bit generator running for an infinite amount of time would
eventually produce the equivalent bit sequence of any particular piece
of software. Infinity being, well, rather infinite and humans being
mortal and all, infinite runs on a RBG didn't seem like all that great
of an option, so I kept thinking... Then I realized that any file can
be represented by a sequence of numbers. All you have to do is find
the equation that will output those number sequences and you've got a
highly-compressed way to recreate any file. Just send the equation
give it a start and end value and let the computer save the output as a
binary file. Unfortunately I was never able to take IMC beyond the
purely theoretical.<br>
<br>
</body>
</html>