The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
List-decoding of binary Goppa codes up to the binary Johnson bound
[article]
2010
arXiv
pre-print
We study the list-decoding problem of alternant codes, with the notable case of classical Goppa codes. The major consideration here is to take into account the size of the alphabet, which shows great influence on the list-decoding radius. This amounts to compare the generic Johnson bound to the q-ary Johnson bound. This difference is important when q is very small. Essentially, the most favourable case is q=2, for which the decoding radius is greatly improved, notably when the relative minimum
arXiv:1012.3439v1
fatcat:wapmpvtxjjetbjyasm5wzmmewm