Por favor, use este identificador para citar o enlazar este ítem:
https://doi.org/10.1109/TIT.2018.2868446
Twittear
Registro completo de metadatos
| Campo DC | Valor | Lengua/Idioma |
|---|---|---|
| dc.contributor.author | Bernal Buitrago, José Joaquín | - |
| dc.contributor.author | Guerreiro, Marines | - |
| dc.contributor.author | Simón Pinero, Juan Jacobo | - |
| dc.contributor.other | Facultades, Departamentos, Servicios y Escuelas::Facultades de la UMU::Facultad de Matemáticas | es |
| dc.date.accessioned | 2024-01-22T15:50:52Z | - |
| dc.date.available | 2024-01-22T15:50:52Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.citation | IEEE Trans. Inform. Theory, 65(3) (2019), 1752-1763. | es |
| dc.identifier.issn | 1557-9654 | - |
| dc.identifier.issn | 0018-9448 | - |
| dc.identifier.uri | http://hdl.handle.net/10201/137523 | - |
| dc.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 | es |
| dc.description.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. | es |
| dc.format | application/pdf | es |
| dc.format.extent | 26 | es |
| dc.language | eng | es |
| dc.publisher | IEEE | es |
| dc.relation | MINECO MTM2016-77445-P y Fundación Séneca | es |
| dc.rights | info:eu-repo/semantics/openAccess | es |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | Abelian code | es |
| dc.subject | Bounds for minimum distance | es |
| dc.subject | Algorithm | es |
| dc.subject | True minimum distance | es |
| dc.title | From ds-bounds for cyclic codes to true minimum distance for abelian codes | es |
| dc.type | info:eu-repo/semantics/article | es |
| dc.identifier.doi | https://doi.org/10.1109/TIT.2018.2868446 | - |
| Aparece en las colecciones: | Artículos: Matemáticas | |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| DSBounds.pdf | 426,54 kB | Adobe PDF |  Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons
