Publication: Permutation decoding of first-order Generalized Reed-Muller codes
Authors
Bernal Buitrago, José Joaquín ; Simón Pinero, Juan Jacobo
item.page.secondaryauthor
item.page.director
Publisher
publication.page.editor
publication.page.department
DOI
https://doi.org/10.1142/S0219498826501951
item.page.type
info:eu-repo/semantics/preprint
Description
Abstract
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study how to implement it for the family of first-order Generalized Reed-Muller codes.Then, we give examples which show that we improve the number of errors we can correct in comparison with the known results for this family of codes. Finally, we deal, from a probabilistic point of view, with the problem of determining when the algorithm only needs to use a smaller PD-like set.
publication.page.subject
Citation
item.page.embargo
Collections
Ir a Estadísticas
Este ítem está sujeto a una licencia Creative Commons. http://creativecommons.org/licenses/by-nc-nd/4.0/