Sciweavers

CODCRY
2011
Springer

List Decoding for Binary Goppa Codes

13 years 2 months ago
List Decoding for Binary Goppa Codes
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) errors in a length-n classical irreducible degree-t binary Goppa code. Compared to the best previous polynomialtime list-decoding algorithms for the same codes, the new algorithm corrects approximately t2 /2n extra errors.
Daniel J. Bernstein
Added 25 Aug 2011
Updated 25 Aug 2011
Type Journal
Year 2011
Where CODCRY
Authors Daniel J. Bernstein
Comments (0)