Reed-Solomon-Gabidulin Codes

Codes de Reed-Solomon-Gabidulin

Xavier Caruso (1, 2) , Amaury Durand (3)

1 IMB - Institut de Mathématiques de Bordeaux
2 LFANT - Lithe and fast algorithmic number theory
3 UFC - Université de Franche-Comté

We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an extension to Reed-Solomon codes on the one hand and Gabidulin codes on the other hand. We prove that our codes have good properties with respect to the minimal distance and design an efficient decoding algorithm.

Mots clés: Ore polynomials; Gabidulin codes; Coding theory

Domaines: Théorie de l'information et codage [math.IT]; Anneaux et algèbres [math.RA]

Xavier Caruso, Amaury Durand. Reed-Solomon-Gabidulin Codes. 2018. ⟨hal-01949409v2⟩