Smaller Decoding Exponents: Ball-Collision Decoding
- 1 January 2011
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2010, 743-760
- https://doi.org/10.1007/978-3-642-22792-9_42
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- A Statistical Decoding Algorithm for General Linear Block CodesLecture Notes in Computer Science, 2001
- On the complexity of minimum distance decoding of long linear codesIEEE Transactions on Information Theory, 1999
- Minimal vectors in linear codesIEEE Transactions on Information Theory, 1998
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- Failure of the McEliece public-key cryptosystem under message-resend and related-message attackLecture Notes in Computer Science, 1997
- New approaches to reduced-complexity decodingDiscrete Applied Mathematics, 1991
- The complexity of information set decodingIEEE Transactions on Information Theory, 1990
- Security-related comments regarding McEliece's public-key cryptosystemIEEE Transactions on Information Theory, 1989
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- Error-Correction Coding for Digital CommunicationsPublished by Springer Science and Business Media LLC ,1981