A module minimization approach to Gabidulin decoding via interpolation
From MaRDI portal
Recommendations
- List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques
- Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases
- Coding and Cryptography
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Fast decoding of Gabidulin codes
Cites work
- A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation
- A Rank-Metric Approach to Error Control in Random Network Coding
- Bilinear forms over a finite field, with applications to coding theory
- Bounds on List Decoding of Rank-Metric Codes
- Coding and Cryptography
- Coding for Errors and Erasures in Random Network Coding
- Fast decoding of Gabidulin codes
- Fraction-free row reduction of matrices of Ore polynomials.
- scientific article; zbMATH DE number 5296403 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- scientific article; zbMATH DE number 910964 (Why is no real title available?)
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Minimal Gröbner bases and the predictable leading monomial property
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Non-commutative Gröbner bases in algebras of solvable type
- On Metrics for Error Correction in Network Coding
- On the key equation
- Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius
- Theory of codes with maximum rank distance
- Using Algebraic Geometry
Cited in
(3)
This page was built for publication: A module minimization approach to Gabidulin decoding via interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241165)
