This video is very good! BUT WHY THERE IS NO EXAMPLE FOR ERROR LOCATING AND CURRECTING ?! There was an example for generating codes with rs in GF(2^3) and it was very useful but in decoding stage we had just formulas!
0:30.. I think it is more appropriate to say the codes were invented. You discover something when it was existing already but invent something which did not exist before.
HIstory - the code that Reed Solomon worked with in 1958 to 1960 or so was based on using a fixed set of data points, treating a message as a sequence of values. At around the same time, BCH code treated a bit stream as a polynomial with 1 bit coefficients, and there was a practical decoder (versus the original scheme of generating polynomials for every combination of k symbols out of n symbols, and choosing the most common one, which wasn't practical except for small messages). As noted in the WIki article: "By 1963 (or possibly earlier), J. J. Stone (and others) recognized that Reed Solomon codes could use the BCH scheme of using a fixed generator polynomial", instead of a fixed set of data points, and although the two encoding schemes are different, both are called Reed Solomon. en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_correction .
This video is very good! BUT WHY THERE IS NO EXAMPLE FOR ERROR LOCATING AND CURRECTING ?! There was an example for generating codes with rs in GF(2^3) and it was very useful but in decoding stage we had just formulas!
Thank you very much for this lecture. The only lecture I found easy to follow after thorough research.
0:30.. I think it is more appropriate to say the codes were invented. You discover something when it was existing already but invent something which did not exist before.
In 46:40, i think $X_l = \gamma_j^{l}$ should be corrected as $X_l =\gamma_j^{j_l}$. Am I right?
Wonderful nice explaining 👍
HIstory - the code that Reed Solomon worked with in 1958 to 1960 or so was based on using a fixed set of data points, treating a message as a sequence of values. At around the same time, BCH code treated a bit stream as a polynomial with 1 bit coefficients, and there was a practical decoder (versus the original scheme of generating polynomials for every combination of k symbols out of n symbols, and choosing the most common one, which wasn't practical except for small messages). As noted in the WIki article: "By 1963 (or possibly earlier), J. J. Stone (and others) recognized that Reed Solomon codes could use the BCH scheme of using a fixed generator polynomial", instead of a fixed set of data points, and although the two encoding schemes are different, both are called Reed Solomon. en.wikipedia.org/wiki/Reed%E2%80%93Solomon_error_correction .