Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders

IEEE Transactions on Communications

Volumn 49, Issue 5, 2001, Pages 779-783

  Truong, T K ^a,b   Jeng, J H ^a,b   Reed, I S ^a,c  

^a IEEE   (Taiwan)

^b I SHOU UNIVERSITY   (Taiwan)

^c University of Southern California ^*  (United States)

Author keywords

Berlekamp Rumsey Solomon algorithm; Chien search; Error locator polynomial; P polynomial; Reed Solomon code.

Indexed keywords

ERROR LOCATOR POLYNOMIALS; REED-SOLOMON CODES;

ALGORITHMS; CODES (SYMBOLS); CODING ERRORS; COMPUTER SIMULATION; ERROR DETECTION; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

DECODING;

EID: 0035334168     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.923801     Document Type: Article

References (9)

1. Cyclic decoding procedures for Bose-Chaudhuri-Hocquenghem codes
2. On the solution of algebraic equations over finite fields
3. On a special class of polynomials
4. Contributions to the theory of finite field