• 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.

    Browse

    All of UVaDOCCommunitiesBy Issue DateAuthorsSubjectsTitles

    My Account

    Login

    Statistics

    View Usage Statistics

    Share

    View Item 
    •   UVaDOC Home
    • SCIENTIFIC PRODUCTION
    • Departamentos
    • Dpto. Álgebra, Análisis Matemático, Geometría y Topología
    • DEP96 - Artículos de revista
    • View Item
    •   UVaDOC Home
    • SCIENTIFIC PRODUCTION
    • Departamentos
    • Dpto. Álgebra, Análisis Matemático, Geometría y Topología
    • DEP96 - Artículos de revista
    • View Item
    • español
    • English
    • français
    • Deutsch
    • português (Brasil)
    • italiano

    Export

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

    Citas

    Academic Search

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

    Título
    Relative generalized Hamming weights of one-point algebraic geometric codes
    Autor
    Geil, Olav
    Martin, Stefano
    Matsumoto, Ryutaroh
    Ruano Benito, Diegountranslated ORCID
    Luo, Yuan
    Año del Documento
    2014
    Descripción
    Producción Científica
    Documento Fuente
    IEEE Transactions on Information Theory. Volume 60, Issue 10, pages 5938-5949 (2014)
    Abstract
    Security of linear ramp secret sharing schemes can be characterized by the relative generalized Hamming weights of the involved codes. In this paper, we elaborate on the implication of these parameters and devise a method to estimate their value for general one-point algebraic geometric codes. As it is demonstrated, for Hermitian codes, our bound is often tight. Furthermore, for these codes, the relative generalized Hamming weights are often much larger than the corresponding generalized Hamming weights.
    Revisión por pares
    SI
    DOI
    http://dx.doi.org/10.1109/TIT.2014.2345375
    Patrocinador
    This research is supported by the Danish National Research Foundation, the National Natural Science Foundation of China (Grant No. 11061130539 - the Danish-Chinese Center for Applications of Algebraic Geometry in Coding Theory and Cryptography), Japan Society for the Promotion of Science (Grant Nos. 23246071 and 26289116), the Danish Council for Independent Research (Grant No. DFF--4002-00367), the Spanish MINECO (Grant No. MTM2012-36917-C03-03), National Basic Research Program of China (Grant No. 2013CB338004), and National Natural Science Foundation of China (Grant No. 61271222).
    Idioma
    eng
    URI
    http://uvadoc.uva.es/handle/10324/31737
    Derechos
    openAccess
    Collections
    • DEP96 - Artículos de revista [45]
    Show full item record
    Files in this item
    Nombre:
    IEEE2014eprint.pdf
    Tamaño:
    271.4Kb
    Formato:
    Adobe PDF
    Thumbnail
    FilesOpen
    Attribution-NonCommercial-NoDerivatives 4.0 InternationalExcept where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International

    Comentarios

    Universidad de Valladolid

    Powered by MIT's. DSpace software, Version 5.10