Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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

Isabella Panaccione 1
1 GRACE - Geometry, arithmetic, algorithms, codes and encryption
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
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.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.inria.fr/hal-03177569
Contributor : Isabella Panaccione <>
Submitted on : Wednesday, April 7, 2021 - 5:15:39 PM
Last modification on : Thursday, April 8, 2021 - 3:37:07 AM

File

ms.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

16

Files downloads

115