19 search results - page 1 / 4 » List Decoding for Binary Goppa Codes |
CODCRY
2011
Springer
12 years 8 months ago
2011
Springer
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) err...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Different variants of the code-based McEliece cryptosystem were proposed to reduce the size of the public key. All these variants use very structured codes, which open the door t...
ASIACRYPT
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A (n,d,e), the smallest for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size up to radius e, is determined for all d 2e...