Fast decoding of Gabidulin codes
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 177612 (Why is no real title available?)
- scientific article; zbMATH DE number 910964 (Why is no real title available?)
- scientific article; zbMATH DE number 922674 (Why is no real title available?)
- A Rank-Metric Approach to Error Control in Random Network Coding
- A method for solving key equation for decoding goppa codes
- Bilinear forms over a finite field, with applications to coding theory
- Coding and Cryptography
- Coding for Errors and Erasures in Random Network Coding
- Fast decoding of Gabidulin codes
- Linearized Shift-Register Synthesis
- Maximum-rank array codes and their application to crisscross error correction
- Probabilistic algorithm for finding roots of linearized polynomials
- Theory of codes with maximum rank distance
- Theory of non-commutative polynomials
Cited in
(32)- On transform-domain error and erasure correction by Gabidulin codes
- A module minimization approach to Gabidulin decoding via interpolation
- Fast operations on linearized polynomials and their applications in coding theory
- Erasure decoding for Gabidulin codes
- Decoding interleaved Gabidulin codes using Alekhnovich's algorithm
- Decoding supercodes of Gabidulin codes and applications to cryptanalysis
- On the list decodability of rank-metric codes containing Gabidulin codes
- Extension of Overbeck's attack for Gabidulin-based cryptosystems
- Low-rank matrix recovery using Gabidulin codes in characteristic zero
- On syndrome decoding of punctured Reed-Solomon and Gabidulin codes
- Improved syndrome decoding of lifted L-interleaved Gabidulin codes
- Randomized decoding of Gabidulin codes beyond the unique decoding radius
- New rank codes based encryption scheme using partial circulant matrices
- Decoding algorithm for Gabidulin codes
- Fast decoding of Gabidulin codes
- Systematic encoders for generalized Gabidulin codes and the \(q\)-analogue of Cauchy matrices
- On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes.
- Extending Coggia-Couvreur attack on Loidreau's rank-metric cryptosystem
- Generalized Gabidulin codes over fields of any characteristic
- scientific article; zbMATH DE number 910964 (Why is no real title available?)
- Fast skew-feedback shift-register synthesis
- On decoding additive generalized twisted Gabidulin codes
- Partition-balanced families of codes and asymptotic enumeration in coding theory
- Covering radius of matrix codes endowed with the rank metric
- A new McEliece-type cryptosystem using Gabidulin-Kronecker product codes
- Rank-metric codes and their applications
- Concatenation of convolutional codes and rank metric codes for multi-shot network coding
- Algebraic decoding of folded Gabidulin codes
- Row reduction applied to decoding of rank-metric and subspace codes
- Properties of subspace subcodes of Gabidulin codes
- Coding and Cryptography
- Dynamics of the \(a\)-map over residually finite Dedekind domains and applications
This page was built for publication: Fast decoding of Gabidulin codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1934220)
