Preserved Topic: Compression 100:1

ZeoSync has announced a breakthrough in data compression that allows for 100:1 lossless compression of random data. Do you think it's going to be a realety
http://www.zeosync.com/flash/flash.html

Woah, I read a little on their website (I'm in a rush) and it sounds to be a promising breakthrough in digital compresssion.

So they are claiming that their technologies can take 100 bytes and turn it into a single byte.

That is interesting.

I wish I could believe that were possible. I am one of those who would need proof.

There must be really huge limitations on this... First off you would probabally only be able to work with large files, and second you would need tremendouse processing power in order to achomplish these goals...

If it is possible well, more power to the world, I can save a ton on bandwith. I mean say you want transfer your 6.4 gig hard drive, just compress it down to 64 megs and send it. Your 140 meg could now fit on a floppy, and your 75 gig hard drive could fit on a CD...

Just seems a little too good to be true.

101011001100110011001111111000010101000000011111110<edit by doc, added a
line break (big number!)>0000111101010101010101111111101010101000010101010

could be compressed into 1

wouldn't that be nice.



[This message has been edited by DocOzone (edited 03-25-2002).]

That the company's technology takes data files and "creates multidimensional constructs" out of them.

Freaky

so they go up the platters, across the platters, and onto parralell-universe-platters.

Oh now I get it...

The open up a black hole, stuff the data in there, and then pull it back out in whole when needed, now wasn't that a simple solution, should we all have thought of that.

Well, I've heard of chip technologies that are exploring the '3rd' dimension, but compression? That's new. I have to agrre with Warmage, I'll need to see proof on this. However, there was a report on TV about a guy here in Germany who supposedly wrote the compression fomula for this stuff, so....apparently he uses more 'numbers' (i.e. 0-9) for his compression, which, if true, would allow for a much 'bigger' compression rate. I think I'll wait, and see..

The poster has demanded we remove all his contributions, less he takes legal action.
We have done so.
Now Tyberius Prime expects him to start complaining that we removed his 'free speech' since this message will replace all of his posts, past and future.
Don't follow his example - seek real life help first.

time ago I thought of this even:

is the 2 in 1 compression valid?
i mean take two bytes and store into one byte...
which also means everything will be half size.

I tried and tried...but asked myself this:
what happens if we half the half?
then half the half of the half?
can we store every possible data sequence in just 1 or even 100 bytes ?

Nope, because compressed data can't necessarily be compressed as much as what it came from. When data is compressed, it makes use of patterns in the original data, so the new data doesn't have those patterns anymore. That means it can't be compressed as well. Each time you compress, you get less compression out of it, so the amount of compression asymptotically approaches a certain percentage of the original file size.

=)

I dunno; I buy the 100:1 compression ratio thing, although I'm sure it requires a very large file to begin with in order to compress that well. Obviously, we can't compress 100 bits into one bit, but 10000000 into 100000 bits is believable; we just have to take advantage of patterns, and if we can find a way to mathematically express complicated patterns with as few numbers as possible, we can acheive high compression ratios.

0000
0001
0010
0011
0100
0101
0110
0111
1000
1001
1010
1011
1100
1101
1110
1111

Now, once you have the string all binary numbers from 0 to 15 can you take these numbers and find say an algorithm to cut these values in half?

If not maybe try 0-63 and see if you can come up with some kind of scheme.

Try a scheme where you have to take the binary numbers and use binary numbers in the output.

Try another scheme where you can use other data values to store representations of 0 and 1.

Then try to break the binary string (positive):

0000000100100011010001010110011110001001101010111100110111101111

into a 2:1 ratio. Then try to compress it even more.

Ultimately you should input an ascii text file and output the compressed file that is 1/2 the size. It is somewhat eazy since ASCII values are all the same, however it should be a trial of fun.

If you can do this try making an algorithm that encompasses all the ascii values and cuts the ascii values into half the size using only other ascii values.

Compression is interesting.