1. Digitum: Repositorio Institucional de la Universidad de Murcia
  2. Investigación
  3. Departamentos de la UM
  4. Matemáticas
  5. Artículos: Matemáticas
Por favor, use este identificador para citar o enlazar este ítem: https://doi.org/10.3934/amc.2016018

Registro completo de metadatos
Campo DCValorLengua/Idioma
dc.contributor.authorBernal Buitrago, José Joaquín-
dc.contributor.authorBueno Carreño, Diana H.-
dc.contributor.authorSimón Pinero, Juan Jacobo-
dc.contributor.otherFacultades, Departamentos, Servicios y Escuelas::Departamentos de la UMU:: Matemáticases
dc.date.accessioned2024-02-07T09:12:30Z-
dc.date.available2024-02-07T09:12:30Z-
dc.date.issued2016-
dc.identifier.citationAdvances in Mathematics of Communications, 10 (2), 2016: 459-474es
dc.identifier.urihttp://hdl.handle.net/10201/138834-
dc.description©2016. 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 Advances in Mathematics of Communications (AMC). To access the final edited and published work see https://doi.org/10.3934/amc.2016018-
dc.description.abstractIn this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a polynomial of the form X^n −1. We apply our results to the study of those BCH codes C, with designed distance δ, that have minimum distance d(C) = δ. Finally, we present some examples of new binary BCH codes satisfying that condition. To do this, we make use of two related tools: the discrete Fourier transform and the notion of apparent distance of a code, originally defined for multivariate abelian codes.es
dc.formatapplication/pdfes
dc.format.extent11es
dc.languageenges
dc.publisherAmerican Institute of Mathematical Sciences (AIMS)es
dc.relationMINECO (Ministerio de Economía y Competitividad), (Fondo Europeo de Desarrollo Regional) project MTM2012-35240, Programa Hispano Brasileño de Cooperación Universitaria PHB2012-0135, and Fundación Séneca of Murcia. Departamento Administrativo de Ciencia, Tecnología e Innovación de la República de Colombia.es
dc.rightsinfo:eu-repo/semantics/openAccesses
dc.rightsAttribution-NoCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.titleCyclic and BCH Codes whose Minimum Distance Equals their Maximum BCH boundes
dc.typeinfo:eu-repo/semantics/articlees
dc.identifier.doihttps://doi.org/10.3934/amc.2016018-
Aparece en las colecciones:Artículos: Matemáticas

Ficheros en este ítem:
Fichero Descripción TamañoFormato 
BernalBuenoSimon-Final.pdf310,77 kBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro sencillo del ítem Mostrar el registro PREMIS del ítem  Estadísticas


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