Row reduction applied to decoding of rank-metric and subspace codes
- 2 August 2016
- journal article
- research article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 82 (1-2) , 389-409
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (BO 867/29-3, BO 867/34-1)
- Deutsche Forschungsgemeinschaft (BO 867/34-1)
This publication has 35 references indexed in Scilit:
- A linear algebraic approach to multisequence shift-register synthesisProblems of Information Transmission, 2011
- Key equations for list decoding of Reed–Solomon codes and how to solve themJournal of Symbolic Computation, 2010
- List decoding of Reed–Solomon codes from a Gröbner basis perspectiveJournal of Symbolic Computation, 2008
- Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed–Solomon CodesIEEE Transactions on Information Theory, 2005
- On lattice reduction for polynomial matricesJournal of Symbolic Computation, 2003
- Efficient decoding of Reed-Solomon codes beyond half the minimum distanceIEEE Transactions on Information Theory, 2000
- Maximum-rank array codes and their application to crisscross error correctionIEEE Transactions on Information Theory, 1991
- Factoring multivariate polynomials over finite fieldsJournal of Computer and System Sciences, 1985
- Theory of Non-Commutative PolynomialsAnnals of Mathematics, 1933
- On a special class of polynomialsTransactions of the American Mathematical Society, 1933