Publication:
New advances in permutation decoding of first-order Reed-Muller codes

Thumbnail Image
Files
New Advances PD RM.pdf(279.98 KB)
Date
2023
relationships.isAuthorOfPublication
relationships.isSecondaryAuthorOf
relationships.isDirectorOf
Authors
Bernal Buitrago, José Joaquín
item.page.secondaryauthor
item.page.director
Publisher
Elsevier
publication.page.editor
publication.page.department
Matemáticas
DOI
https://doi.org/10.1016/j.ffa.2023.102182
item.page.type
info:eu-repo/semantics/article
Description
©2023. “Once the embargo has passed this document Will be 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 Finite Fields and Their Applications. To access the final edited and published work see https://doi.org/10.1016/j.ffa.2023.102182
Abstract
In this paper we describe a variation of the classical permutation decoding algorithm that can be applied to any affine-invariant code with respect to certain type of information sets. In particular, we can apply it to the family of first-order Reed-Muller codes with respect to the information sets introduced in \cite{BS}. Using this algortihm we improve considerably the number of errors we can correct in comparison with the known results in this topic.
publication.page.subject
Permutation decoding , Reed Muller codes , Algorithms
Citation
Finite Fields Appl. Vol. 88. 14 páginas. Artículo 102182. 2023.
URI
http://hdl.handle.net/10201/137524
item.page.embargo
2025-06-01
Collections
Artículos
Ir a Estadísticas