Chien search
= Chien search
{c}
{wiki}
A Chien search finds error positions by evaluating an <error locator polynomial> at every possible inverse location value $\omega^{-j}$. A zero identifies coordinate $j$. Using the recurrence between successive powers of $\omega$ avoids recomputing all monomials from scratch.