Root-evaluation syndrome for a cyclic code
ID: root-evaluation-syndrome-for-a-cyclic-code
Let be a polynomial root of the generator polynomial of a cyclic code over a finite field , viewed in an field extension. Every codeword satisfies , so a received polynomial has syndrome . A single-symbol error givesTo identify both value and position from this one syndrome, the maps must be injective over the allowed nonzero values and coordinate positions. Equivalently, the powers for distinct positions must not be proportional by a nonzero element of the base finite field. In the binary case , distinct powers suffice.
New to topics? Read the docs here!