Name
Abstract | ||
|---|---|---|
In this paper, we first review the classical Petterson–Gorenstein–Zierler decoding algorithm for the class of alternant codes, which includes Reed–Solomon, Bose–Chaudhuri–Hocquenghem and classical Goppa codes. Afterwards, we present an improvement of the method to find the number of errors and the error-locator polynomial. Finally, we illustrate the procedure with several examples. In two appendices, we sketch the main features of the computer algebra system designed and developed to support the computations. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s40314-019-0795-7 | Computational and Applied Mathematics |
Keywords | Field | DocType |
Alternant codes, RS codes, BCH codes, Classical Goppa codes, Computer algebra systems, 11T71, 94B05, 94B35, 94B15 | Discrete mathematics,Algebra,Polynomial,Decoding methods,Mathematics,Sketch,Computation | Journal |
Volume | Issue | ISSN |
38 | 1 | 2238-3603 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafel Farré | 1 | 4 | 2.20 |
| Narcís Sayols | 2 | 0 | 1.69 |
| Sebastià Xambó-Descamps | 3 | 2 | 1.93 |