2025/01/08 by Couvreur, Alain, Pratihar, Rakhi · 1 citation
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2501.04766
In this article, we investigate the decoding of the rank metric Reed--Muller codes introduced by Augot, Couvreur, Lavauzelle and Neri in 2021. These codes are defined from Abelian Galois extensions extending the construction of Gabidulin codes over arbitrary cyclic Galois extensions. We propose a polynomial time algorithm that rests on the structure of Dickson matrices, works on any such code and corrects any error of rank up to half the minimum distance.