Name
Abstract | ||
|---|---|---|
A method is described which allows to evaluate efficiently a polynomial in a
(possibly trivial) extension of the finite field of its coefficients. Its
complexity is shown to be lower than that of standard techniques when the
degree of the polynomial is large with respect to the base field. Applications
to the syndrome computation in the decoding of cyclic codes, Reed-Solomon codes
in particular, are highlighted. |
Year | DOI | Keywords |
|---|---|---|
2011 | 10.1109/AUSCTW.2011.5728754 | finite fields,reed-solomon codes,polynomial evaluation,syn- drome computation,polynomials,decoding,finite field,polynomial |
DocType | Volume | Citations |
Journal | abs/1102.4 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Davide Schipani | 1 | 50 | 7.67 |
| M. Elia | 2 | 50 | 7.16 |
| Joachim Rosenthal | 3 | 142 | 17.90 |