Article thumbnail

Improved hybrid algorithm for finding roots of error-locator polynomials

By Sergei Fedorenko, Peter Trifonov, Elena Costa and Harald Haas


Abstract. In this paper we suggest a hybrid method for finding toots of error locator polynomials. We first review a fast version of the Chien search algorithm based on the decomposition of the error locator polynomial into a sum of multiples of affine polynomials. We then propose to combine it with modified analytical methods for solution of polynomials of small degree in radicals. We suggest, in particular, two efficient decompositions, whose combination with analytical algorithms yields a sig-nificant reduction in time-complexity, as proved by means of simulation

Topics: Chien search, error locator polynomial, p-polynomial, linearized polynomial, affine polynomial, BCH code, Reed-Solomon
Year: 2003
DOI identifier: 10.1002/ett.4460140504
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.