Skip navigation
Por favor, use este identificador para citar o enlazar este ítem: http://uvadoc.uva.es/handle/10324/31722
Título: Improved constructions of nested code pairs
Autor: Galindo, Carlos
Geil, Olav
Hernando, Fernando
Ruano, Diego
Año del Documento: 2018
Descripción: Producción Científica
Documento Fuente: IEEE Transactions on Information Theory. Volume 64, Issue 4, pages 2444-2459 (2018)
Resumen: Two new constructions of linear nested code pairs are given for which the codimension and the relative minimum distances of the codes and their duals are good. By this we mean that for any two out of the three parameters the third parameter of the constructed code pair is large. Such pairs of nested codes are indispensable for the determination of good linear ramp secret sharing schemes. They can also be used to ensure reliable communication over asymmetric quantum channels. The new constructions result from carefully applying the Feng-Rao bounds to a family of codes defined from multivariate polynomials and Cartesian product point sets.
Revisión por Pares: SI
DOI: http://dx.doi.org/10.1109/TIT.2017.2755682
Patrocinador: The Danish Council for Independent Research (Grant N. DFF–4002-00367)
Ministerio de Economía, Industria y Competitividad (Projects MTM2015-65764-C3-2-P and MTM2015-69138-REDT)
University Jaume I (Grant N. P1-1B2015-02)
Version del Editor: https://ieeexplore.ieee.org/document/8048519/
Idioma: eng
URI: http://uvadoc.uva.es/handle/10324/31722
Derechos: info:eu-repo/semantics/openAccess
Aparece en las colecciones:DEP96 - Artículos de revista

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
IEEE2018eprint1.pdf350,43 kBAdobe PDFThumbnail
Visualizar/Abrir

Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons Creative Commons

Comentarios
Universidad de Valladolid
Powered by MIT's. DSpace software, Version 5.5
UVa-STIC