Can we compress random data
blaisemcrowly.in
blaisemcrowly.in
no claim is made to the effect saying "Can be compressed indefinitely"
As I have told, the efficiency of it being able to compress over and over and over again may have chance for data corruption unless better checks and methods are added. (which will again increase the minimum required file size. but you can still compress it)
Are you sure that this algorithm will compress my 1073741825 bytes file to a 1073741824 bytes or less file?
Now I am making few assumptions for a practical implementation of the technique.
PAT() = Units place of sum of all digits. (no claims made,just for an example)
Now I can replace the three bytes with the following values 033 and 036
I have also specially stated the challenges of retrieving this information as as of not there are no built in integrity checks.
There, saved you a click.