Attending Sudan's decoding radius with no genus penalty for algebraic geometry codes - Inria - Institut national de recherche en sciences et technologies du numérique
Pré-Publication, Document De Travail Année : 2021

Attending Sudan's decoding radius with no genus penalty for algebraic geometry codes

Résumé

In this paper we present a decoding algorithm for algebraic geometry codes with error-correcting capacity beyond half the designed distance of the code. This algorithm comes as a fusion of the Power Error Locating Pairs algorithm for algebraic geometry codes and the technique used by Ehrhard in order to correct these codes up to half the designed distance. The decoding radius of this algorithm reaches that of Sudan algorithm, without any penalty given by the genus of the curve.
Fichier principal
Vignette du fichier
ms.pdf (452.4 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03177569 , version 1 (23-03-2021)
hal-03177569 , version 2 (07-04-2021)

Identifiants

Citer

Isabella Panaccione. Attending Sudan's decoding radius with no genus penalty for algebraic geometry codes. 2021. ⟨hal-03177569v1⟩
112 Consultations
252 Téléchargements

Altmetric

Partager

More