Show simple item record

hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierLithe and fast algorithmic number theory [LFANT]
dc.contributor.authorCARUSO, Xavier
hal.structure.identifierUniversité de Franche-Comté [UFC]
dc.contributor.authorDURAND, Amaury
dc.date.accessioned2024-04-04T03:02:24Z
dc.date.available2024-04-04T03:02:24Z
dc.date.created2018-12
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/192979
dc.description.abstractEnWe 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.isoen
dc.subject.enOre polynomials
dc.subject.enGabidulin codes
dc.subject.enCoding theory
dc.titleCodes de Reed-Solomon-Gabidulin
dc.title.enReed-Solomon-Gabidulin Codes
dc.typeDocument de travail - Pré-publication
dc.subject.halMathématiques [math]/Théorie de l'information et codage [math.IT]
dc.subject.halMathématiques [math]/Anneaux et algèbres [math.RA]
dc.identifier.arxiv1812.09147
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-01949409
hal.version1
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01949409v1
bordeaux.COinSctx_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

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record