79 citations · 191 across the 19 of their papers we have counts for
20 papers
Gabidulin Decoding via Minimal Bases of Linearized Polynomial Modules
Anna-Lena Trautmann, Margreta Kuijper
We show how Gabidulin codes can be decoded via parametrization by using interpolation modules over the ring of linearized polynomials with composition. Our decoding algorithm compu…
Gröbner Bases for Linearized Polynomials
Margreta Kuijper, Anna-Lena Trautmann
In this work we develop the theory of Gröbner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.
Iterative List-Decoding of Gabidulin Codes via Gröbner Based Interpolation
Margreta Kuijper, Anna-Lena Trautmann
We show how Gabidulin codes can be list decoded by using an iterative parametrization approach. For a given received word, our decoding algorithm processes its entries one by one,…
Cross-Error Correcting Integer Codes over
Anna-Lena Trautmann, Emanuele Viterbo
In this work we investigate codes in that can correct errors that occur in just one coordinate of the codeword, with a magnitude of up to a given parameter …
List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm
Margreta Kuijper, Anna-Lena Trautmann
We show how Gabidulin codes can be list decoded by using a parametrization approach. For this we consider a certain module in the ring of linearized polynomials and find a minimal…
Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks
Natalia Silberstein, Anna-Lena Trautmann
This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We prese…