List-decoding of AG codes without genus penalty

arXiv2307.04203MaRDI QIDQ6443086FDOQ6443086

Authors: Peter Beelen, Maria Montanucci 

Publication date: 9 July 2023

Abstract: In this paper we consider algebraic geometry (AG) codes: a class of codes constructed from algebraic codes (equivalently, using function fields) by Goppa. These codes can be list-decoded using the famous Guruswami-Sudan (GS) list-decoder, but the genus $g$ of the used function field gives rise to negative term in the decoding radius, which we call the genus penalty. In this article, we present a GS-like list-decoding algorithm for arbitrary AG codes, which we call the emph{inseparable GS list-decoder}. Apart from the multiplicity parameter $s$ and designed list size $ell$, common for the GS list-decoder, we introduce an inseparability exponent $e$. Choosing this exponent to be positive gives rise to a list-decoder for which the genus penalty is reduced with a factor $1/p^e$ compared to the usual GS list-decoder. Here $p$ is the characteristic. Our list-decoder can be executed in $ildemathcalO(sel{l}^{omega}m{u}^{omega-1}{p}^e(n+g))$ field operations, where $n$ is the code length.

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Decoding (94B35)

This page was built for publication: List-decoding of AG codes without genus penalty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6443086)