| 摘要 |
<p>Method for decoding data coded in Reed-Solomon code with correction of errors, wherein the code words are represented by bits forming a polynomial degree (n-1) comprised of m symbols of information and k control symbols with m+k = n-1, the control symbols being formed by words of 2<p> bits, said words forming the elements of a finite body of Gallois CG (2<p>) comprising the following steps: (i) dividing a packet of bits to be coded by a code generator polynomial of order k, and as a result the portion of the division provides the m information symbols and the remainder of the division be k control symbols; (ii) calculating the syndromes of the polynomial representative of a code word for certain roots of the code generator polynomial, those syndromes being eight and being related by a system of four linear equations of which the coefficients ( sigma 1 - sigma 4) are the locations of the errors in the code word; and resolving those localizing equations.</p> |
