I am working on an assignment for a class I am taking.
I need to give the location and magnitude of a codeword's error, if possible, for a couple given syndromes. If I can figure out the methodology on how to do it for one I could do the rest, but I am lost on the first one.
Here is the syndrome: [2, 2, 0, 1]
I am to use a Reed-Solomon code with q = 11 and the primitive element as 2.
I created the following H matrix trying to solve this:
1 1 1 1 1 1 1 1 1 1
1 2 4 8 5 10 9 7 3 6
1 4 5 9 3 2 8 10 7 6
1 8 9 6 4 10 3 2 5 7
But since all I have is the syndrome, I'm not sure where to go from here. I'm sure I'm missing something rather straight forward here, hopefully someone can point it out to me.
I found Berlekamp, Peterson, and Euclidean approaches online, but we haven't gone over any of those and I don't understand how they work from the limited explanation online. We have used an error locating polynomial approach but I don't know how to apply it to this scenario, since to get to the point where you have 4 equations with 4 unknowns you would need to know the input codeword.
Thank you.