Compression of random binary data

[MRAB]

On 2016-07-11 19:30, MRAB wrote:
> On 2016-07-11 18:52, jonas.thornvall at gmail.com wrote:
>> What kind of statistic law or mathematical conjecture  or is it even a physical law is violated by compression of random binary data?
>>
>> I only know that Shanon theorised it could not be done, but were there any proof?
>>
>> What is to say that you can not do it if the symbolic representation is richer than the symbolic represenatation of the dataset.
>>
>> Isn't it a fact that the set of squareroots actually depict numbers in a shorter way than their actual representation.
>>
>> Now the inpretator or program must know the rules. And i have very good rules to make it happen.
>>
> If you want a challenge:
>
> The Enduring Challenge of Compressing Random Data
> http://www.drdobbs.com/architecture-and-design/the-enduring-challenge-of-compressing-ra/240049914
>
It turns out there's a newsgroup for compression, and they're used to 
getting claims about compressing random data. In fact, so much so that 
it's in their FAQ:

comp.compression Frequently Asked Questions (part 1/3)
Section - [9] Compression of random data (WEB, Gilbert and others)
http://www.faqs.org/faqs/compression-faq/part1/section-8.html