Skip to Main content Skip to Navigation
Conference papers

List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound

Abstract : We study the list-decoding problem of alternant codes (which includes obviously that of classical Goppa codes). The major consideration here is to take into account the (small) size of the alphabet. This amounts to comparing the generic Johnson bound to the q-ary Johnson bound. The most favourable case is q = 2, for which the decoding radius is greatly improved. Even though the announced result, which is the list-decoding radius of binary Goppa codes, is new, we acknowledge that it can be made up from separate previous sources, which may be a little bit unknown, and where the binary Goppa codes has apparently not been thought at. Only D. J. Bernstein has treated the case of binary Goppa codes in a preprint. References are given in the introduction. We propose an autonomous and simplified treatment and also a complexity analysis of the studied algorithm, which is quadratic in the blocklength n, when decoding away of the relative maximum decoding radius.
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-00643794
Contributor : Daniel Augot <>
Submitted on : Tuesday, November 22, 2011 - 6:06:00 PM
Last modification on : Thursday, March 5, 2020 - 6:24:13 PM
Long-term archiving on: : Thursday, February 23, 2012 - 2:35:31 AM

File

augot_barbier_couvreur_itw.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Daniel Augot, Morgan Barbier, Alain Couvreur. List-Decoding of Binary Goppa Codes up to the Binary Johnson Bound. IEEE Information Theory Workshop, Oct 2011, Paraty, Brazil. pp.229 - 233, ⟨10.1109/ITW.2011.6089384⟩. ⟨hal-00643794⟩

Share

Metrics

Record views

701

Files downloads

463