| 摘要 |
A generalized Reed-Solomon coding is characterized by the codeword block size n, the information block size k and the generator polynomial g(x), which is a function of beta and r according to the equation: g(x)=(x+ beta <r>)(x+ beta <r+1>)(x+ beta <r+2>)(x+ beta <r+3>)(x+ beta <r+4>)...(x+ beta <r+2t-1>) where beta is an element of the Galois field and r is the initial exponent for beta . For decoding, an approach to finding error patterns uses a modified general form that takes advantage of properties of the generating polynomial. With the disclosed universal RS encoding-decoding approach, a user only needs to specify four parameters, namely those values (n, k, beta , r), and any RS coding design specification can be met using a single framework. |
