Reed-Solomon-Gabidulin Codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2018

Reed-Solomon-Gabidulin Codes

Codes de Reed-Solomon-Gabidulin

Xavier Caruso
Institut de Mathématiques de Bordeaux
Lithe and fast algorithmic number theory
Amaury Durand
  • Function : Author
  • PersonId : 1040243
Université de Franche-Comté

Abstract

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.

Domains

Information Theory [math.IT] Rings and Algebras [math.RA]
Fichier principal
Vignette du fichier
gabidulin-hal.pdf (148.5 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Xavier Caruso  : Connect in order to contact the contributor

https://hal.science/hal-01949409

Submitted on : Sunday, January 13, 2019-10:59:23 AM

Last modification on : Saturday, April 27, 2024-3:11:19 AM

Long-term archiving on: Sunday, April 14, 2019-12:20:19 PM

Download

Dates and versions

hal-01949409 , version 1 (21-12-2018)
hal-01949409 , version 2 (13-01-2019)

Identifiers

Cite

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

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA UNIV-FCOMTE IMB INSMI INRIA2
229 View
311 Download

Altmetric

Share

Gmail Facebook X LinkedIn More