
Originally Posted by
Ali Imran Khan Shirani
You have a 128bits long bit string. We split it to two 64bit strings. Result is:
00110010001000000011001000011100010110001000011111 00011110001110
00100010110000000001011110011110011110111011111111 00111111011111
Where these two strings (as now) put on separate lines, if we see closely, there are a lot of bits matching in both strings at same positions. In this case 45 bits match which have same either 0 or 1 at same position. 22 0's and 23 1's matched exactly in same positions in both strings.
Survey question:
What is the best method you propose to compress this 128 bit string to less than 112 bits ?
NOTE: I asked this question before to Dr. Matt, and I am not sure what he proposed, as far I remember it was, try compressing the XOR of these 2 values.
Input is requested.