= Root-evaluation syndrome for a cyclic code
Let $\alpha\ne0$ be a <polynomial root> of the <generator polynomial of a cyclic code> over a <finite field> $\mathbb F_q$, viewed in an <field extension>. Every <codeword> $c(X)$ satisfies $c(\alpha)=0$, so a received <polynomial> $r=c+e$ has <syndrome> $r(\alpha)=e(\alpha)$. A single-symbol error $e(X)=aX^j$ gives
$$
r(\alpha)=a\alpha^j,\qquad a\in\mathbb F_q^{\times}.
$$
To identify both value and position from this one <syndrome>, the maps $(a,j)\mapsto a\alpha^j$ 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 $a=1$, distinct powers suffice.
For nonbinary errors, distinct powers alone do not suffice. Over $\mathbb F_3$, take $\alpha=-1$ and two positions. Errors $1$ in position zero and $-X$ in position one both evaluate to $1$, although $1$ and $\alpha$ are distinct. Additional <syndromes> or stronger conditions on the powers are then necessary.
Back to article page