… the list-decoding problem of alternant codes (which includes obviously that of classical Goppa
codes… This amounts to comparing the generic Johnson bound to the q-ary Johnson bound. …

… 2 is devoted to recall the list-decoding problem, the Johnson bounds generic or q-ary, and
… of the codes we wish to decode, namely alternant codes and classical Goppa codes. Section …

… can decode binary Goppa codes—in fact any alternant code—up to the small-field
Johnson bound. Also here, the bottleneck of the complexity is the construction of the interpolation …

… 2 is devoted to recall the list-decoding problem, the Johnson bounds generic or q-ary, and
… of the codes we wish to decode, namely alternant codes and classical Goppa codes. Section …

… In light of a new study on list decoding algorithms for binary Goppa codes, … binary Johnson
bound is compared to the others. We will show in Section III that using binary Goppa codes …

… algorithm has the ability to correct up to t + u errors [5]… the list-decoding algorithm is used in
the binary Goppa codes based on … Johnson bound,’’ in Proc. IEEE Inf. Theory Workshop, Oct. …

… Fq; in particular, in the classical Goppa codes used in the McEliece and Niederreiter public-…
-speed list-decoding algorithm that corrects errors up to the big-field Johnson bound. The …

… codes can be decoded almost up to the Singleton bound by collaborative decoding [10]. Since
interleaved Goppa codes are subcodes of interleaved RS codes, … using list decoding,” in …

… [11] DJ Bernstein, “List decoding for binary Goppa codes,” in Coding and cryptology –
IWCC … Couvreur, “List-decoding of binary Goppa codes up to the binary Johnson bound,” in …

… ) codes, and demonstrate that they achieve list-decoding … ): these are the famous Goppa
codes of Tsfasman, Vladut and Zink … The Johnson bound asserts that any code has list-decoding …