3 ms·
I am no expert either, but I just checked Wikipedia on Reed-Solomon codes [1]: > By adding t check symbols to the data, a Reed–Solomon code can detect (but not
by heinrichhartman 6y ago
I am no expert either, but I just checked Wikipedia on Reed-Solomon codes [1]:
> By adding t check symbols to the data, a Reed–Solomon code can detect (but not correct) any combination of up to and including t erroneous symbols, OR locate and correct up to and including ⌊t/2⌋ erroneous symbols at unknown locations
So it looks like you would have to choose between, either:
A) correcting 6 bits OR
B) detecting 12 bit errors.
No?
[1] https://en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_correction https://en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_cor...
- wtallis 6y agoThe correct interpretation there is that for any given R-S code, the tolerance for correctable errors is half as many bits as the tolerance for uncorrectable but still detectable errors. If you have an R-S code constructed to correct 6 bits or detect 12-bit errors, then for a given message: if the number of corrupted bits is no more than six, you can reconstruct the original message if the number of corrupted bits is between 6 and 12, you will detect the corruption if the number of corrupted bits is larger than 12, you may or may not detect the corruption.