RT info:eu-repo/semantics/article
T1 Generalization of the Lee-O'Sullivan list decoding for one-point AG codes
A1 Matsumoto, Ryutaroh
A1 Ruano Benito, Diego
A1 Geil, Olav
AB 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.
YR 2013
FD 2013
LK http://uvadoc.uva.es/handle/10324/31746
UL http://uvadoc.uva.es/handle/10324/31746
LA eng
NO Journal of Symbolic Computation. Volume 55, pages 1-9 (2013)
NO Producción Científica
DS UVaDOC
RD 30-abr-2024