Consider RS codes with symbols from GF 
, and let 
be a
primitive element in GF .
The generator polynomial of a primitive t-error correcting RS code
of length 
is
.
Let 
be the message to
be encoded, k=n-2t. The 2t parity-check digits are the coefficients of
the remainder 
resulting from dividing
the message polynomial 
by the generator polynomial g(x).