Decoding Random Binary Linear Codes in $2^{n/20}$: How $1+1=0$ Improves Information Set Decoding

Anja Becker, Antoine Joux, Alexander May, Alexander Meurer. Decoding Random Binary Linear Codes in $2^{n/20}$: How $1+1=0$ Improves Information Set Decoding. IACR Cryptology ePrint Archive, 2012:26, 2012. [doi]

@article{BeckerJMM12,
  title = {Decoding Random Binary Linear Codes in $2^{n/20}$: How $1+1=0$ Improves Information Set Decoding},
  author = {Anja Becker and Antoine Joux and Alexander May and Alexander Meurer},
  year = {2012},
  url = {http://eprint.iacr.org/2012/026},
  note = {informal publication},
  researchr = {https://researchr.org/publication/BeckerJMM12},
  cites = {0},
  citedby = {0},
  journal = {IACR Cryptology ePrint Archive},
  volume = {2012},
  pages = {26},
}