On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes

@inproceedings{May2015OnCN,
  title={On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes},
  author={Alexander May and Ilya Ozerov},
  booktitle={EUROCRYPT},
  year={2015}
}
We propose a new decoding algorithm for random binary linear codes. The so-called information set decoding algorithm of Prange (1962) achieves worst-case complexity 2 . In the late 80s, Stern proposed a sort-and-match version for Prange’s algorithm, on which all variants of the currently best known decoding algorithms are build. The fastest algorithm of Becker, Joux, May and Meurer (2012) achieves running time 2 in the full distance decoding setting and 2 with half (bounded) distance decoding… CONTINUE READING
Highly Cited
This paper has 78 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 47 extracted citations

Quantum Information Set Decoding Algorithms

IACR Cryptology ePrint Archive • 2017
View 5 Excerpts
Highly Influenced

Compressing Vector OLE

ACM Conference on Computer and Communications Security • 2018
View 1 Excerpt

78 Citations

0204020152016201720182019
Citations per Year
Semantic Scholar estimates that this publication has 78 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Bucketing Coding and Information Theory for the Statistical High-Dimensional Nearest-Neighbor Problem

IEEE Transactions on Information Theory • 2010
View 5 Excerpts
Highly Influenced

A method for finding codewords of small weight

J. Stern
In Proceedings of the 3rd International Colloquium on Coding Theory and Applications, • 1989
View 18 Excerpts
Highly Influenced

The use of information sets in decoding cyclic codes

IRE Trans. Information Theory • 1962
View 8 Excerpts
Highly Influenced

Finding Correlations in Subquadratic Time, with Applications to Learning Parities and Juntas

2012 IEEE 53rd Annual Symposium on Foundations of Computer Science • 2012
View 3 Excerpts

Towards Removing the Curse of Dimensionality

N. J. Hopper, M. Blum
Theory of Computing • 2012

Similar Papers

Loading similar papers…