Codes de Reed-Solomon-Gabidulin
hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
dc.contributor.author | CARUSO, Xavier | |
hal.structure.identifier | Université de Franche-Comté [UFC] | |
dc.contributor.author | DURAND, Amaury | |
dc.date.accessioned | 2024-04-04T03:02:24Z | |
dc.date.available | 2024-04-04T03:02:24Z | |
dc.date.created | 2018-12 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/192979 | |
dc.description.abstractEn | 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. | |
dc.language.iso | en | |
dc.subject.en | Ore polynomials | |
dc.subject.en | Gabidulin codes | |
dc.subject.en | Coding theory | |
dc.title | Codes de Reed-Solomon-Gabidulin | |
dc.title.en | Reed-Solomon-Gabidulin Codes | |
dc.type | Document de travail - Pré-publication | |
dc.subject.hal | Mathématiques [math]/Théorie de l'information et codage [math.IT] | |
dc.subject.hal | Mathématiques [math]/Anneaux et algèbres [math.RA] | |
dc.identifier.arxiv | 1812.09147 | |
bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
hal.identifier | hal-01949409 | |
hal.version | 1 | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-01949409v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.title=Codes%20de%20Reed-Solomon-Gabidulin&rft.atitle=Codes%20de%20Reed-Solomon-Gabidulin&rft.au=CARUSO,%20Xavier&DURAND,%20Amaury&rft.genre=preprint |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |