15 citations · 16 across the 2 of their papers we have counts for
7 papers · 1 filter
Fast Decoding of AG Codes
Peter Beelen, Johan Rosenkilde, Grigory Solomatov
We present an efficient list decoding algorithm in the style of Guruswami-Sudan for algebraic geometry codes. Our decoder can decode any such code using $\tilde{\mathcal O}(s\ell^ω…
Bounds on List Decoding of Linearized Reed-Solomon Codes
Sven Puchinger, Johan Rosenkilde
Linearized Reed-Solomon (LRS) codes are sum-rank metric codes that fulfill the Singleton bound with equality. In the two extreme cases of the sum-rank metric, they coincide with Re…
Decoding of Interleaved Alternant Codes
Lukas Holzbaur, Hedongliang Liu, Alessandro Neri +4
Interleaved Reed-Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a…
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric
Hannes Bartz, Thomas Jerkovits, Sven Puchinger +1
We speed up existing decoding algorithms for three code classes in different metrics: interleaved Gabidulin codes in the rank metric, lifted interleaved Gabidulin codes in the subs…
Improved Power Decoding of Interleaved One-Point Hermitian Codes
Sven Puchinger, Johan Rosenkilde, Irene Bouw
We propose a new partial decoding algorithm for -interleaved one-point Hermitian codes that can decode-under certain assumptions-an error of relative weight up to $1-(\tfrac{k+g…
Two-Point Codes for the Generalized GK curve
Elise Barelli, Peter Beelen, Mrinmoy Datta +2
We improve previously known lower bounds for the minimum distance of certain two-point AG codes constructed using a Generalized Giulietti-Korchmaros curve (GGK). Castellanos and Ti…