[QUOTE]Originally posted by nietzsche
I know this is just a rehash ... but it seems boggling to me that you can have a random hash of data and have *any* significant compression. As far as I know, most established compression routines work somewhat like the following: every time it sees 001001001001001001001, for example, it replaces that with 'a' or something akin to that.

-----------------------------------------------------------------------

Actually - 001001001001001001001 does not translate well - since binary bit representation is done it sets of 8 - but what the hell - this is how it would translate in ascii:

First Eight:
00100100 = 38 = &

The next Eight:

10010010 = 146 = ’

The next set:

Well - is only 5 bits - so I will assume you meant to put 3 ( or 00000011) zeros after it and it would be:

01001000 = 72 = H

So 00100100 10010010 01001000 would translate to " &’H " which is not really an " a " is it?

Or we could say that it represents "some number" - and then it would translate to:

001001001001001001001:
0+0+262144+0+0+32768+0+0+4096+0+0+512+0+0+64+0+0+8+0+0+1 = 299593
God - I must be bored if I just converted binary digits . . .



------------------------------------------------------