Improved constructions of nested code pairs
Ver/ Abrir
Impacto
Scholar |
Otros documentos de la autoría: Galindo, Carlos; Geil, Olav; Hernando, Fernando; Ruano, Diego
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7037
comunitat-uji-handle3:10234/8635
comunitat-uji-handle4:
INVESTIGACIONMetadatos
Título
Improved constructions of nested code pairsFecha de publicación
2017-09Editor
IEEECita bibliográfica
GALINDO, Carlos, et al. Improved constructions of nested code pairs. IEEE Transactions on Information Theory, 2017.Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
http://ieeexplore.ieee.org/abstract/document/8048519/Versión
info:eu-repo/semantics/submittedVersionPalabras clave / Materias
Resumen
Two new constructions of linear code pairs C2 ⊂ C1 are given for which the codimension and the relative minimum distances M1(C1,C2), M1(C┴2 , C┴1) are good. By this we mean that for any two out of the three parameters ... [+]
Two new constructions of linear code pairs C2 ⊂ C1 are given for which the codimension and the relative minimum distances M1(C1,C2), M1(C┴2 , C┴1) 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 [40]. They can also be used to ensure reliable communication over asymmetric quantum channels [54]. The new constructions result from carefully applying the Feng-Rao bounds [21], [31] to a family of codes defined from multivariate polynomials and Cartesian product point sets. [-]
Proyecto de investigación
The Danish Council for Independent Research (Grant No. DFF–4002-00367); Spanish MINECO/FEDER (Grants No. MTM2015-65764-C2-2-P and MTM2015-69138-REDT); University Jaume I (Grant No. P1-1B2015-02)Derechos de acceso
© Copyright 2018 IEEE - All rights reserved.
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
Aparece en las colecciones
- MAT_Articles [770]