| Information | |
|---|---|
| has gloss | eng: In abstract algebra, the Chien search, named after R. T. Chien, is a recursive algorithm for determining roots of polynomials defined over a finite field. The most typical use of the Chien search is in finding the roots of error-locator polynomials encountered in decoding Reed-Solomon codes and BCH codes. |
| lexicalization | eng: Chien search |
| instance of | e/Finite field |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint