Por favor, use este identificador para citar o enlazar este ítem: https://doi.org/10.1109/TIT.2018.2868446

Título: From ds-bounds for cyclic codes to true minimum distance for abelian codes
Fecha de publicación: 2019
Editorial: IEEE
Cita bibliográfica: IEEE Trans. Inform. Theory, 65(3) (2019), 1752-1763.
ISSN: 1557-9654
0018-9448
Palabras clave: Abelian code
Bounds for minimum distance
Algorithm
True minimum distance
Resumen: In this paper we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to abelian (or multivariate) codes through the notion of B-apparent distance. We also study conditions for an abelian code to verify that its B-apparent distance reaches its (true) minimum distance. Then we construct some codes as an application.
Autor/es principal/es: Bernal Buitrago, José Joaquín
Guerreiro, Marines
Simón Pinero, Juan Jacobo
Facultad/Departamentos/Servicios: Facultades, Departamentos, Servicios y Escuelas::Facultades de la UMU::Facultad de Matemáticas
URI: http://hdl.handle.net/10201/137523
DOI: https://doi.org/10.1109/TIT.2018.2868446
Tipo de documento: info:eu-repo/semantics/article
Número páginas / Extensión: 26
Derechos: info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Descripción: ©2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ This document is the Accepted, version of a Published Work that appeared in final form in IEEE Transactions on Information Theory. To access the final edited and published work see https://doi.org/10.1109/TIT.2018.2868446
Aparece en las colecciones:Artículos: Matemáticas

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
DSBounds.pdf426,54 kBAdobe PDFVista previa
Visualizar/Abrir


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