Re: I know this won't work, I just want to know -why-.

Cladio Grondi wrote -

"I would be glad to replace believing with knowledge, so I have put
here
an example of my reasoning behind 'this strange worldview':

#01: Let's archive a 100 bit long string along with 10 bits of error
correction data. This makes a 110 bits large archive file i.e. 10%
additional data for error correction.
#02: Let's assume, that only maximum of 5 bits in the 100 bit long
string can get damaged (and none in the correction data area). This
makes maximum of 5% of damaged data.
#03: With the 10% additional error correction data available, the error
correction algorithm should be always able to recover the original data
where maximal 5% of it is damaged , so:
#04a1: If one bit is damaged there are 100 possible differently damaged
strings,
#04a2: If two bits are damaged there are 100*99/1*2 = 4950 possible
differently damaged strings.
#04a3: If three bits are damaged, there are 100*99*98/1*2*3 = 161700
#04a4: If four bits are damaged, there are 100*99*98*97/1*2*3*4
=3921225
#04a5: If five bits are damaged, therea are 100*99*98*97*96/1*2*3*4*5 =
75287520 possible differently damaged strings.
#04b: It makes a total of 79375495 possible differently damaged strings
#04c: The error correction data bits must be able to distinguish all
the
differently damaged strings to be able to choose the right one as the
corrected version.
#4d: 79375495 is as binary number 100101110110010110010000111 27 bits
long, but there are only 10 bits error correction data available, so
not
all the differently damaged strings can be distinguished to choose the
right original one among all the possible versions."

Thank you! This is exactly the line of reasoning I was looking for.

.