CiteULike is a free online bibliography manager. Register and you can start organising your references online.
Tags

# List Decoding for Binary Goppa Codes

## edited by: YeowMeng Chee, Zhenbo Guo, San Ling, Fengjing Shao, Yuansheng Tang, Huaxiong Wang, Chaoping Xing

In Coding and Cryptology, Vol. 6639 (2011), pp. 62-80, doi:10.1007/978-3-642-20901-7_4  Key: citeulike:12104455

## Likes (beta)

This copy of the article hasn't been liked by anyone yet.

### Abstract

This paper presents a Patterson-style list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately $n-\sqrtn(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.