| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 403180 | Journal of Symbolic Computation | 2013 | 9 Pages |
Abstract
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and OʼSullivan (2009), based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander (2010), . Our generalization enables us to apply the fast algorithm to compute a Gröbner basis of a module proposed by Lee and OʼSullivan (2009), , which was not possible in another generalization by Lax (2012).
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
