Name
Abstract | ||
|---|---|---|
We derive the Wu list-decoding algorithm for generalized Reed–Solomon (GRS) codes by using Gröbner bases over modules and the Euclidean algorithm as the initial algorithm instead of the Berlekamp–Massey algorithm. We present a novel method for constructing the interpolation polynomial fast. We give a new application of the Wu list decoder by decoding irreducible binary Goppa codes up to the binary Johnson radius. Finally, we point out a connection between the governing equations of the Wu algorithm and the Guruswami–Sudan algorithm, immediately leading to equality in the decoding range and a duality in the choice of parameters needed for decoding, both in the case of GRS codes and in the case of Goppa codes. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/TIT.2013.2243800 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
Goppa codes,Reed-Solomon codes,binary codes,decoding,interpolation,Berlekamp-Massey algorithm,Euclidean algorithm,Guruswami-Sudan algorithm,Wu algorithm,binary Johnson radius,generalized Reed-Solomon codes,interpolation polynomial fast,list-decoding binary Goppa codes,rational interpolation-based list-decoding,Goppa code,Johnson radius,Reed–Solomon code,list decoding,list size,rational interpolation | Journal | 59 |
Issue | ISSN | Citations |
6 | 0018-9448 | 8 |
PageRank | References | Authors |
0.50 | 17 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Peter Beelen | 1 | 16 | 2.11 |
| Tom Høholdt | 2 | 186 | 28.53 |
| Johan S. R. Nielsen | 3 | 15 | 1.00 |
| Yingquan Wu | 4 | 257 | 18.46 |