2024-03-28T16:26:43Zhttp://uvadoc.uva.es/oai/requestoai:uvadoc.uva.es:10324/317462021-06-24T07:41:12Zcom_10324_32197com_10324_952com_10324_894com_10324_1129com_10324_931col_10324_32199col_10324_1193
Matsumoto, Ryutaroh
Ruano Benito, Diego
Geil, Olav
2018-09-25T11:24:12Z
2018-09-25T11:24:12Z
2013
Journal of Symbolic Computation. Volume 55, pages 1-9 (2013)
http://uvadoc.uva.es/handle/10324/31746
http://dx.doi.org/10.1016/j.jsc.2013.03.001
We generalize the list decoding algorithm for Hermitian codes proposed by Lee and O'Sullivan based on Gröbner bases to general one-point AG codes, under an assumption weaker than one used by Beelen and Brander. Our generalization enables us to apply the fast algorithm to compute a Gröbner basis of a module proposed by Lee and O'Sullivan, which was not possible in another generalization by Lax.
eng
info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/4.0/
Attribution-NonCommercial-NoDerivatives 4.0 International
Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
info:eu-repo/semantics/article