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

DOI10.1016/J.FFA.2023.102182MaRDI QIDQ6426039arXivFDO

Authors José Joaquín Bernal, Juan Jacobo Simón

Publication date 10 February 2023

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.FFA.2023.102182

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

arXiv classification

cs.ITmath.IT

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 [2]. Using this algortihm we improve considerably the number of errors we can correct in comparison with the known results in this topic.

This page was built for publication: New advances in permutation decoding of first-order Reed-Muller codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6426039)