Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

324

Voted

CODCRY
2011
Springer

247views Cryptology» more CODCRY 2011»

List Decoding for Binary Goppa Codes

14 years 10 months ago

List Decoding for Binary Goppa Codes

Download cr.yp.to

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

Real-time Traffic

Algorithm | Algorithms | CODCRY 2011 | Cryptology | Polynomial Time |

claim paper

Related Content

» Key Reduction of McElieces Cryptosystem Using List Decoding

» How to Achieve a McElieceBased Digital Signature Scheme

» Better Binary ListDecodable Codes Via Multilevel Concatenation

» List Decodability at Small Radii

» A Lower Bound on List Size for List Decoding

» Smaller Decoding Exponents BallCollision Decoding

» The Complexity of Local List Decoding

» Explicit Codes Achieving List Decoding Capacity ErrorCorrection With Optimal Redundancy

» An improved list decoding algorithm for the second order ReedMuller codes and its applicat...

Post Info
More Details (n/a)

Added	25 Aug 2011
Updated	25 Aug 2011
Type	Journal
Year	2011
Where	CODCRY
Authors	Daniel J. Bernstein

Comments (0)