Show simple item record

hal.structure.identifierMathématiques & Sécurité de l'information [XLIM-MATHIS]
dc.contributor.authorGABORIT, Philippe
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorZÉMOR, Gilles
dc.date.accessioned2024-04-04T03:11:44Z
dc.date.available2024-04-04T03:11:44Z
dc.date.issued2016-10-10
dc.identifier.issn0018-9448
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/193802
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers
dc.title.enOn the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
dc.typeArticle de revue
dc.identifier.doi10.1109/TIT.2016.2616127
dc.subject.halInformatique [cs]/Complexité [cs.CC]
bordeaux.journalIEEE Transactions on Information Theory
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-01443111
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01443111v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=IEEE%20Transactions%20on%20Information%20Theory&rft.date=2016-10-10&rft.eissn=0018-9448&rft.issn=0018-9448&rft.au=GABORIT,%20Philippe&Z%C3%89MOR,%20Gilles&rft.genre=article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record