Anyone here with math background who can help with Reed-Solomon codes problem?It's needed for the New Address Format:
https://forums.nxtcrypto.org/viewtopic.php?f=17&t=524Original ricot's idea was to use RS codes to auto-correct typos to get superficial, but cool advantage over bitcoin addresses.
But it seems there is a problem. We know that with parity = 4 the algorithm can reliably detect up to 4 errors or correct up to 2.
What isn't mentioned is that those choices seem to be
exclusive. You can either detect 4 errors for sure and get general 1/million collision probability (we use 20-bit redundancy) OR you can try to correct errors.
In almost quantum-physics-style weirdness, if you try to correct errors,
you cannot use the previous check anymore!And error correction fails miserably if there are more than 2 errors: it cannot detect that there are more. So it corrects into an incorrect address and there seems to be no way to verify this.
To put it in laymans terms: you make more than 2 typos and you will almost certainly lose your money. This is unacceptable.
So can anyone either confirm this behavior or tell me what I am missing?