A Chien search finds error positions by evaluating an error locator polynomial at every possible inverse location value . A zero identifies coordinate . Using the recurrence between successive powers of avoids recomputing all monomials from scratch.
Articles by others on the same topic
Chien search is an efficient algorithm used for finding factors of polynomials, particularly in the context of error correction codes, such as Reed-Solomon codes. It is named after the mathematician Tsun-Hsing Chien. Here's a high-level overview of how it works: 1. **Polynomial Representation**: In error correction coding, data is typically represented as a polynomial over a finite field.