• español
  • English
  • français
  • Deutsch
  • português (Brasil)
  • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Listar

    Todo UVaDOCComunidadesPor fecha de publicaciónAutoresMateriasTítulos

    Mi cuenta

    Acceder

    Estadísticas

    Ver Estadísticas de uso

    Compartir

    Ver ítem 
    •   UVaDOC Principal
    • PRODUCCIÓN CIENTÍFICA
    • Departamentos
    • Dpto. Álgebra, Análisis Matemático, Geometría y Topología
    • DEP96 - Artículos de revista
    • Ver ítem
    •   UVaDOC Principal
    • PRODUCCIÓN CIENTÍFICA
    • Departamentos
    • Dpto. Álgebra, Análisis Matemático, Geometría y Topología
    • DEP96 - Artículos de revista
    • Ver ítem
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano

    Exportar

    RISMendeleyRefworksZotero
    • edm
    • marc
    • xoai
    • qdc
    • ore
    • ese
    • dim
    • uketd_dc
    • oai_dc
    • etdms
    • rdf
    • mods
    • mets
    • didl
    • premis

    Citas

    Por favor, use este identificador para citar o enlazar este ítem:http://uvadoc.uva.es/handle/10324/31730

    Título
    List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
    Autor
    Matsumoto, Ryutaroh
    Ruano Benito, DiegoAutoridad UVA Orcid
    Geil, Olav
    Año del Documento
    2017
    Descripción
    Producción Científica
    Documento Fuente
    Journal of Symbolic Computation. Volume 79, Part 2, pages 384-410 (2017)
    Resumen
    We generalize the unique decoding algorithm for one-point AG codes over the Miura-Kamiya Cab curves proposed by Lee, Bras-Amorós and O'Sullivan (2012) to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng-Rao improved code construction, prove equality between its error correcting capability and half the minimum distance lower bound by Andersen and Geil (2008) that has not been done in the original proposal except for one-point Hermitian codes, remove the unnecessary computational steps so that it can run faster, and analyze its computational complexity in terms of multiplications and divisions in the finite field. As a unique decoding algorithm, the proposed one is empirically and theoretically as fast as the BMS algorithm for one-point Hermitian codes. As a list decoding algorithm, extensive experiments suggest that it can be much faster for many moderate size/usual inputs than the algorithm by Beelen and Brander (2010). It should be noted that as a list decoding algorithm the proposed method seems to have exponential worst-case computational complexity while the previous proposals (Beelen and Brander, 2010; Guruswami and Sudan, 1999) have polynomial ones, and that the proposed method is expected to be slower than the previous proposals for very large/special inputs.
    Revisión por pares
    SI
    DOI
    10.1016/j.jsc.2016.02.015
    Patrocinador
    This research was partially supported by the MEXT Grant-in-Aid for Scientific Research (A) Nos. 23246071 and 26289116, the Villum Foundation through their VELUX Visiting Professor Programme 2011--2012 and 2014, 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, the Danish Council for Independent Research, grant DFF-4002-00367, and the Spanish MINECO grant No. MTM2012-36917-C03-03.
    Version del Editor
    https://www.sciencedirect.com/science/article/pii/S0747717116000316?via%3Dihub
    Idioma
    eng
    URI
    http://uvadoc.uva.es/handle/10324/31730
    Derechos
    openAccess
    Aparece en las colecciones
    • DEP96 - Artículos de revista [95]
    • IMUVA - Artículos de Revista [103]
    Mostrar el registro completo del ítem
    Ficheros en el ítem
    Nombre:
    JSC2017eprint.pdf
    Tamaño:
    203.5Kb
    Formato:
    Adobe PDF
    Thumbnail
    Visualizar/Abrir
    Attribution-NonCommercial-NoDerivatives 4.0 InternationalLa licencia del ítem se describe como Attribution-NonCommercial-NoDerivatives 4.0 International

    Universidad de Valladolid

    Powered by MIT's. DSpace software, Version 5.10