Fast decoding of Gabidulin codes
- 4 April 2012
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 66 (1-3), 57-73
- https://doi.org/10.1007/s10623-012-9659-5
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Linearized Shift-Register SynthesisIEEE Transactions on Information Theory, 2011
- Fast encoding and decoding of Gabidulin codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Coding for Errors and Erasures in Random Network CodingIEEE Transactions on Information Theory, 2008
- A Welch–Berlekamp Like Algorithm for Decoding Gabidulin CodesLecture Notes in Computer Science, 2006
- A New Algorithm for Decoding Reed-Solomon CodesPublished by Springer Nature ,2003
- Finite FieldsPublished by Cambridge University Press (CUP) ,1996
- Maximum-rank array codes and their application to crisscross error correctionIEEE Transactions on Information Theory, 1991
- Bilinear forms over a finite field, with applications to coding theoryJournal of Combinatorial Theory, Series A, 1978
- Theory of Non-Commutative PolynomialsAnnals of Mathematics, 1933
- On a special class of polynomialsTransactions of the American Mathematical Society, 1933