Por favor, use este identificador para citar o enlazar este ítem:
https://doi.org/10.1109/TIT.2018.2817539
Twittear
Título: | Information sets from defining sets for Reed-Muller codes of first and second order |
Fecha de publicación: | 2018 |
Editorial: | IEEE |
Cita bibliográfica: | IEEE Trans. Inform. Theory, 64 (10) (2018) 6484-6497. |
ISSN: | 0018-9448 1557-9654 |
Palabras clave: | Abelian codes Reed Muller Codes Information sets Defining sets |
Resumen: | Reed-Muller codes belong to the family of affine-invariant codes. As such codes they have a defining set that determines them uniquely, and they are extensions of cyclic group codes. In this paper we identify those cyclic codes with multidimensional abelian codes and we use the techniques introduced in \cite{BS} to construct information sets for them from their defining set. For first and second order Reed-Muller codes, we describe a direct method to construct information sets in terms of their basic parameters. |
Autor/es principal/es: | Bernal Buitrago, José Joaquín Simón Pinero, Juan Jacobo |
Facultad/Departamentos/Servicios: | Facultades, Departamentos, Servicios y Escuelas::Departamentos de la UMU::Matemáticas |
URI: | http://hdl.handle.net/10201/137522 |
DOI: | https://doi.org/10.1109/TIT.2018.2817539 |
Tipo de documento: | info:eu-repo/semantics/article |
Número páginas / Extensión: | 18 |
Derechos: | info:eu-repo/semantics/openAccess Attribution-NonCommercial-NoDerivatives 4.0 Internacional |
Descripción: | ©2018. 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.2817539 |
Aparece en las colecciones: | Artículos: Matemáticas |
Ficheros en este ítem:
Fichero | Descripción | Tamaño | Formato | |
---|---|---|---|---|
Info Sets RM.pdf | 336,24 kB | Adobe PDF | Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons