From: Virus@callmeace
man, you're really hopeless at explaining stuff!
Anyway, saying "the advanced calculations from years of mathematical thinking which could be employed" or "the mathematical techniques and knowledge would assuredly be complex and advanced" or maybe "I'm sure a man will come on his white horse and will save the world" looks like hot air to me.
No offence intended, but I need something more than hope
So in stage one The formula maps this binary information of the input file as continuous code being a long number consisting only of the digits 1 and 0.
Well, the input sequence is already a binary string made up of 0s and 1s. Using an "one-to-one" function to remap to another binary string is not going to change anything.
Some inputs would be mapped in a string that compresses better, some others not. On average, you'll end up on par... so this step already looks useless
Anyway: please give us a simple example, so we can understand step by step what you want to do with your input sequence. Here's a 6 bytes sequence:
159, 174, 181, 148, 136, 131
translated in binary, this is:
10011111 10101110 10110101 10010100 10001000 10000011
so uncompressed, the input string is 48 bits, as you can see.
Note that the data present correlation (= similarity) between the samples and that means you can compress them. The data looks quite like the luma taken along a row of a video frame, so we're dealing with something real here.
Please shows us your idea and produce an output binary string (shorter than 48 bits, possibly
). You can do whatever you want, up to and including splitting the string into a couple of pieces to ease your calculations.
Later on I'll show you a very simple and fast way to compress it down, so we can compare the results.