scientific article; zbMATH DE number 7124327
From MaRDI portal
Publication:5241165
zbMath1423.94175MaRDI QIDQ5241165
Anna-Lena Horlemann-Trautmann, Margreta Kuijper
Publication date: 30 October 2019
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
interpolationiterative algorithmparametrizationpolynomial modulesGabidulin codeslinearized polynomialsminimal basisrank metric
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Bounds on codes (94B65) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Decoding (94B35)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal Gröbner bases and the predictable leading monomial property
- Non-commutative Gröbner bases in algebras of solvable type
- Theory of codes with maximum rank distance
- Bilinear forms over a finite field, with applications to coding theory
- Fast decoding of Gabidulin codes
- Fraction-free row reduction of matrices of Ore polynomials.
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Coding for Errors and Erasures in Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Using Algebraic Geometry
- On the key equation
- On Metrics for Error Correction in Network Coding
- A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation
- Bounds on List Decoding of Rank-Metric Codes
- Coding and Cryptography
