A. Barg, Complexity issues in coding theory, Electronic Colloquium on Computational Complexity, 1997.

A. Becker, A. Joux, A. May, and A. Meurer, Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, Advances in Cryptology -EUROCRYPT 2012, Lecture Notes in Comput. Sci, 2012.
DOI : 10.1007/978-3-642-29011-4_31

I. Dumer, On minimum distance decoding of linear codes, Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, pp.50-52, 1991.

M. P. Fossorier, K. Kobara, and H. Imai, Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem, IEEE Transactions on Information Theory, vol.53, issue.1, pp.402-411, 2007.
DOI : 10.1109/TIT.2006.887515

M. E. Ismail and P. Simeonov, Strong asymptotics for Krawtchouk polynomials, Journal of Computational and Applied Mathematics, vol.100, issue.2, pp.121-144, 1998.
DOI : 10.1016/S0377-0427(98)00183-6

URL : https://doi.org/10.1016/s0377-0427(98)00183-6

A. A. Jabri, A Statistical Decoding Algorithm for General Linear Block Codes, Proceedings of the 8 th IMA International Conference, pp.1-8, 2001.
DOI : 10.1007/3-540-45325-3_1

A. May, A. Meurer, and E. Thomae, Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$, Advances in Cryptology -ASIACRYPT 2011, pp.107-124, 2011.
DOI : 10.1007/978-3-642-25385-0_6

A. May and I. Ozerov, On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes, Advances in Cryptology -EUROCRYPT 2015, pp.203-228, 2015.
DOI : 10.1007/978-3-662-46800-5_9

R. Overbeck, Statistical Decoding Revisited, ACISP Lecture Notes in Comput. Sci, vol.4058, pp.283-294, 2006.
DOI : 10.1007/11780656_24

E. Prange, The use of information sets in decoding cyclic codes, IEEE Transactions on Information Theory, vol.8, issue.5, pp.5-9, 1962.
DOI : 10.1109/TIT.1962.1057777

J. Stern, A method for finding codewords of small weight, Coding Theory and Applications, pp.106-113, 1988.
DOI : 10.1007/BFb0019850