Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius
Authors:
- 10 April 2020
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 3-19
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- A New Algorithm for Solving the Rank Syndrome Decoding Problem2018
- Polynomial-time key recovery attack on the Faure–Loidreau scheme based on Gabidulin codesDesigns, Codes and Cryptography, 2017
- On the Complexity of the Rank Syndrome Decoding ProblemIEEE Transactions on Information Theory, 2015
- Error-Correcting Codes in Projective SpaceIEEE Transactions on Information Theory, 2011
- Subspace Polynomials and Limits to List Decoding of Reed–Solomon CodesIEEE Transactions on Information Theory, 2009
- Error and erasure correcting algorithms for rank codesDesigns, Codes and Cryptography, 2008
- A New Public-Key Cryptosystem Based on the Problem of Reconstructing p–PolynomialsLecture Notes in Computer Science, 2006
- A Public Key Encryption Scheme Based on the Polynomial Reconstruction Problem2003
- Bilinear forms over a finite field, with applications to coding theoryJournal of Combinatorial Theory, Series A, 1978
- On the inherent intractability of certain coding problems (Corresp.)IEEE Transactions on Information Theory, 1978