@inproceedings{badc16d036e74ab98992b9cf62188710,
title = "List decoding for binary Goppa codes",
abstract = "This paper presents a Patterson-style list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately $n - \sqrt{n(n-2t-2)}$ errors in a length-n classical irreducible degree-t binary Goppa code. Compared to the best previous polynomial-time list-decoding algorithms for the same codes, the new algorithm corrects approximately $t^2/2n$ extra errors.",
author = "D.J. Bernstein",
year = "2011",
doi = "10.1007/978-3-642-20901-7_4",
language = "English",
isbn = "978-3-642-20900-0",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "62--80",
editor = "Y.M. Chee",
booktitle = "Coding and Cryptology (Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings)",
address = "Germany",
}