Mostrar el registro sencillo del ítem

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

hal.structure.identifierAlgorithmic number theory for cryptology [TANC]
hal.structure.identifierLaboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
dc.contributor.authorAUGOT, Daniel
hal.structure.identifierAlgorithmic number theory for cryptology [TANC]
dc.contributor.authorBARBIER, Morgan
hal.structure.identifierAlgorithmic number theory for cryptology [TANC]
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorCOUVREUR, Alain
dc.contributor.editorShokrollahi. Amin and da Rocha Jr.
dc.contributor.editorValdemar C. and Costa
dc.contributor.editorSueli I. R.
dc.date.accessioned2024-04-04T02:26:18Z
dc.date.available2024-04-04T02:26:18Z
dc.date.issued2011-10-16
dc.date.conference2011-10-16
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/189952
dc.description.abstractEnWe 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.
dc.language.isoen
dc.publisherIEEE
dc.title.enList-Decoding of Binary Goppa Codes up to the Binary Johnson Bound
dc.typeCommunication dans un congrès
dc.identifier.doi10.1109/ITW.2011.6089384
dc.subject.halInformatique [cs]/Théorie de l'information [cs.IT]
dc.subject.halMathématiques [math]/Théorie de l'information et codage [math.IT]
bordeaux.page229 - 233
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleIEEE Information Theory Workshop
bordeaux.countryBR
bordeaux.conference.cityParaty
bordeaux.peerReviewedoui
hal.identifierhal-00643794
hal.version1
hal.invitednon
hal.proceedingsoui
hal.conference.end2011-11-20
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00643794v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2011-10-16&rft.spage=229%20-%20233&rft.epage=229%20-%20233&rft.au=AUGOT,%20Daniel&BARBIER,%20Morgan&COUVREUR,%20Alain&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem