Por favor, use este identificador para citar o enlazar este ítem:
https://doi.org/10.1007/s11786-019-00416-5
Twittear
Registro completo de metadatos
Campo DC | Valor | Lengua/Idioma |
---|---|---|
dc.contributor.author | Bernal Buitrago, José Joaquín | - |
dc.contributor.author | Bueno Carreño, Diana H. | - |
dc.contributor.author | Simón Pinero, Juan Jacobo | - |
dc.contributor.other | Facultades, Departamentos, Servicios y Escuelas::Departamentos de la UMU::Matemáticas | es |
dc.date.accessioned | 2024-02-07T09:13:39Z | - |
dc.date.available | 2024-02-07T09:13:39Z | - |
dc.date.issued | 2020 | - |
dc.identifier.citation | Mathematics in Computer Science 14, 2020: 415 - 421. | es |
dc.identifier.uri | http://hdl.handle.net/10201/138818 | - |
dc.description | ©2020. This manuscript version is made available under the CC-BY 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 Mathematics in Computer Science. To access the final edited and published work see https://doi.org/10.1007/s11786-019-00416-5 | - |
dc.description.abstract | In this note, we apply some techniques developed in [1]–[3] to give a particular construction of bivariate Abelian Codes from cyclic codes, multiplying their dimension and preserving their apparent distance. We show that, in the case of cyclic codes whose maximum BCH bound equals its minimum distance the obtained abelian code verifies the same property; that is, the strong apparent distance and the minimum distance coincide. We finally use this construction to multiply Reed-Solomon codes to abelian codes. | es |
dc.format | application/pdf | es |
dc.format.extent | 5 | es |
dc.language | eng | es |
dc.publisher | Springer | es |
dc.relation | MINECO, project MTM2016-77445-P, and Fundación Séneca of Murcia, project 19880/GERM/15. The second author has been supported by Departamento Administrativo de Ciencia, Tecnología e Innovación de la República de Colombia. | es |
dc.rights | info:eu-repo/semantics/openAccess | es |
dc.rights | Attribution-NoCommercial-NoDerivatives 4.0 Internacional | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | - |
dc.title | Constructions of Abelian Codes multiplying dimension of cyclic codes | es |
dc.type | info:eu-repo/semantics/article | es |
dc.identifier.doi | https://doi.org/10.1007/s11786-019-00416-5 | - |
Aparece en las colecciones: | Artículos: Matemáticas |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
BernalBuenoSimon2018.pdf | 254,58 kB | Adobe PDF | Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons