Decoding algorithm for Gabidulin codes
From MaRDI portal
Publication:3172584
zbMATH Open1251.94045MaRDI QIDQ3172584FDOQ3172584
Authors: Regis F. Babindamana, Cheikh T. Gueye
Publication date: 5 October 2011
Recommendations
Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Decoding (94B35)
Cited In (8)
- Recovering erasures by using MDS codes over extension alphabets
- Erasure decoding for Gabidulin codes
- Decoding Gentzen's Notation
- Fast decoding of Gabidulin codes
- On decoding algorithms for generalized Reed-Solomon codes with errors and erasures
- On the reconstruction of linearized polynomials: a new decoding algorithm for Gabidulin codes.
- On decoding algorithms for Goppa codes
- Coding and Cryptography
This page was built for publication: Decoding algorithm for Gabidulin codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172584)