Name
Abstract | ||
|---|---|---|
We propose a new algorithm for the decoding of random binary linear codes of dimension n that is superior to previous algorithms for high error rates. In the case of Full Distance decoding, the best known bound of (2^{0.0953n}) is currently achieved via the BJMM-algorithm of Becker, Joux, May and Meurer. Our algorithm significantly improves this bound down to (2^{0.0885n}). |
Year | Venue | DocType |
|---|---|---|
2018 | PQCrypto | Conference |
Citations | PageRank | References |
2 | 0.37 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leif Both | 1 | 2 | 0.71 |
| Alexander May | 2 | 89 | 5.98 |