The essence of Reed-Solomon coding
Using Reed-Solomon coding to recover from erasures (at known positions) is relatively straightforward. It can be understood with a basic knowledge of linear algebra and finite field arithmetic.<p>Using RS for error correction (at initially unknown positions) is quite difficult. I wrote a step-by-step guide on it including demo code, and it doesn't even cover the most efficient decoding algorithm (I used PGZ instead of Berlekamp-Massey): <a href="https://www.nayuki.io/page/reed-solomon-error-correcting-code-decoder" rel="nofollow">https://www.nayuki.io/page/reed-solomon-error-correcting-cod...</a>