Finding roots of polynomials over finite fields

IEEE Transactions on Communications

Volumn 50, Issue 11, 2002, Pages 1709-1711

  Fedorenko, Sergei V ^a   Trifonov, Peter V ^a  

^a PETER THE GREAT ST PETERSBURG POLYTECHNIC UNIVERSITY   (Russian Federation)

Author keywords

Affine polynomial; Bose Chaudhuri Hocquenghem (BCH) code; Chien search; Error locator polynomial; Linearized polynomial; p polynomial; Reed Solomon code

Indexed keywords

ALGORITHMS; DECODING; ERROR CORRECTION; VECTORS;

CHIEN SEARCH;

POLYNOMIALS;

EID: 0036863589     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2002.805269     Document Type: Article

References (3)

1. R.T. Chien, B.D. Cunningham, and I.B. Oldham, "Hybrid methods for finding roots of a polynomial with application to BCH decoding," IEEE Trans. Inform. Theory, vol. IT-15, pp. 329-335, 1969.
2. T.-K. Truong, J.-H. Jeng, and I.S. Reed, "Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders," IEEE Trans. Commun., vol. 49, pp. 779-783, May 2001.
3. E.R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.