15 citations · 23 across the 7 of their papers we have counts for
5 papers · 1 filter
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…
Generic bivariate multi-point evaluation, interpolation and modular composition with precomputation
Vincent Neiger, Johan Rosenkilde, Grigory Solomatov
Suppose is a large enough field and is a fixed, generic set of points which is available for precomputation. We introduce a techniqu…
Generic Decoding in the Sum-Rank Metric
Sven Puchinger, Julian Renner, Johan Rosenkilde
We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank m…