next up previous
Next: Berlekamp's Iterative Algorithm for Up: Encoding/Decoding Reed Solomon Codes Previous: Systematic Form Encoding

Decoding Reed-Solomon Codes

Let tex2html_wrap_inline436 be the transmitted code vector and tex2html_wrap_inline438 be the corresponding received vector.

Then tex2html_wrap_inline440 is the error pattern added by the channel, where tex2html_wrap_inline442 is a symbol from GF tex2html_wrap_inline276 .

Assume that the received vector has tex2html_wrap_inline446 errors in positions tex2html_wrap_inline448 . Then tex2html_wrap_inline450 .

Define tex2html_wrap_inline452 , tex2html_wrap_inline454 , the error location numbers. Then, compute the 2t syndromes as follows:

tex2html_wrap_inline458
tex2html_wrap_inline460 .

Expanding we obtain a sequence of 2t algebraic syndrome equations:

displaymath432

The syndrome equations can be translated into a series of linear equations by defining the error-locator polynomial tex2html_wrap_inline464 . tex2html_wrap_inline464 has as its roots the inverses of the error locators tex2html_wrap_inline468 :

displaymath433

Assume that tex2html_wrap_inline470 errors have occurred, where t is the error correcting capability of the code. Then, we obtain the following matrix equation:

tex2html_wrap_inline474




A. Matache
Sun Oct 20 17:42:25 PDT 1996