15 citations · 16 across the 2 of their papers we have counts for
12 papers
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^ω…
Improved Power Decoding of Algebraic Geometry Codes
Sven Puchinger, Johan Rosenkilde, Grigory Solomatov
Power decoding is a partial decoding paradigm for arbitrary algebraic geometry codes for decoding beyond half the minimum distance, which usually returns the unique closest codewor…
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…
Fast Encoding of AG Codes over Curves
Peter Beelen, Johan Rosenkilde, Grigory Solomatov
We investigate algorithms for encoding of one-point algebraic geometry (AG) codes over certain plane curves called curves, as well as algorithms for inverting the encoding…