On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes-Reference-Cited by-同舟云学术

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

Published:2015 Issue: Volume: Page:203-228
ISSN:0302-9743
Container-title:Advances in Cryptology -- EUROCRYPT 2015
language:
Short-container-title:

Author:

May Alexander,Ozerov Ilya

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-46800-5_9

Reference24 articles.

1. Agarwal, P.K., Edelsbrunner, H., Schwarzkopf, O.: Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Discrete & Computational Geometry 6, 407–422 (1991)

2. Alekhnovich, M.: More on Average Case vs Approximation Complexity. In: 44th Symposium on Foundations of Computer Science (FOCS), pp. 298–307 (2003)

3. Lecture Notes in Computer Science;A Becker,2011

4. Lecture Notes in Computer Science;A Becker,2012

5. Brakerski, Z., Vaikuntanathan, V.: Efficient Fully Homomorphic Encryption from (Standard) LWE. In: FOCS, pp. 97–106 (2011)

Cited by 119 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Elliptic code-based oblivious polynomial evaluation;Computer Standards & Interfaces;2024-08

2. SoK: CryptographicEstimators -- a Software Library for Cryptographic Hardness Estimation;Proceedings of the 19th ACM Asia Conference on Computer and Communications Security;2024-07

3. Integer syndrome decoding in the presence of noise;Cryptography and Communications;2024-05-10

4. Concrete Time/Memory Trade-Offs in Generalised Stern’s ISD Algorithm;Lecture Notes in Computer Science;2024

5. High Weight Code-Based Signature Scheme from QC-LDPC Codes;Lecture Notes in Computer Science;2024