Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders (Q4552984)
From MaRDI portal
scientific article; zbMATH DE number 1797997
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders |
scientific article; zbMATH DE number 1797997 |
Statements
Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders (English)
0 references
30 June 2003
0 references
Berlekamp-Rumsey-Solomon algorithm
0 references
Chien search
0 references
error locator polynomial
0 references
\(p\)-polynomial
0 references
Reed-Solomon code
0 references
