Adityon

This is continuation of my previous article on Random data compression-How to use merge sort?. As I mentioned earlier – it is hard or impossible(as of now) to compress million random digit. As per my analysis million random digit file contains around 90 – 110 bytes duplicates or repeated number within every block of 256 [...]

This is continuation of my previous article on Random data compression possibilities. Some of the readers asked how reverse merge sort (merge unsort) can be used to represent 256 unique values using 128bytes(best case) or 224.25(worst case). As illustrated in previous article using merge sort we sort the random input and store bit information of [...]

This is continuation of my previous article on Random data compression possibilities. Compression of unique values As I indicated in previous article if for every 256 bytes each value appears only ones, then we can achieve the compression using any of the below techniques. 1. Using insertion sort – by remembering the position. Using this [...]

Random data compression lossless – Is it possible? The answer is NO (…. and yes!!!) This is little lengthy blog to show and prove the difficulties and possible ways. This article divided into three section. (Before you read further I suggest you to read Mark Nelson “The Million Random Digit Challenge“) 1. Why it is [...]