Attaining Sudan's decoding radius with no genus penalty for algebraic geometry codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year :

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

Abstract

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.59 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

Cite

Isabella Panaccione. Attaining Sudan's decoding radius with no genus penalty for algebraic geometry codes. 2021. ⟨hal-03177569v2⟩
85 View
230 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More