Mostrar el registro sencillo del ítem

dc.contributor.authorMatsumoto, Ryutaroh
dc.contributor.authorRuano Benito, Diego 
dc.contributor.authorGeil, Olav
dc.date.accessioned2018-09-25T11:24:12Z
dc.date.available2018-09-25T11:24:12Z
dc.date.issued2013
dc.identifier.citationJournal of Symbolic Computation. Volume 55, pages 1-9 (2013)es
dc.identifier.urihttp://uvadoc.uva.es/handle/10324/31746
dc.descriptionProducción Científicaes
dc.description.abstractWe 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.es
dc.format.mimetypeapplication/pdfes
dc.language.isoenges
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.titleGeneralization of the Lee-O'Sullivan list decoding for one-point AG codeses
dc.typeinfo:eu-repo/semantics/articlees
dc.identifier.doihttp://dx.doi.org/10.1016/j.jsc.2013.03.001es
dc.peerreviewedSIes
dc.description.projectThis research was partly supported by the MEXT Grant-in-Aid for Scientific Research (A) No. 23246071, the Villum Foundation through their VELUX Visiting Professor Programme 2011--2012, the Danish National Research Foundation and the National Science Foundation of China (Grant No. 11061130539) for the Danish-Chinese Center for Applications of Algebraic Geometry in Coding Theory and Cryptography and by Spanish grant MTM2007-64704 and by Spanish MINECO grant No. MTM2012-36917-C03-03es
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem