Publication: From ds-bounds for cyclic codes to true minimum distance for abelian codes
Authors
Bernal Buitrago, José Joaquín ; Guerreiro, Marines ; Simón Pinero, Juan Jacobo
item.page.secondaryauthor
item.page.director
Publisher
IEEE
publication.page.editor
publication.page.department
DOI
https://doi.org/10.1109/TIT.2018.2868446
item.page.type
info:eu-repo/semantics/article
Description
©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
Abstract
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.
publication.page.subject
Citation
IEEE Trans. Inform. Theory, 65(3) (2019), 1752-1763.
item.page.embargo
Collections
Ir a Estadísticas
Este ítem está sujeto a una licencia Creative Commons. http://creativecommons.org/licenses/by-nc-nd/4.0/