Skip to Main content Skip to Navigation
Conference papers

NP-completeness of the coset weight problem for quasi-dyadic codes

Pierre-Louis Cayrel 1 Khady Diagne Cheikh T. Gueye
1 LHC - Laboratoire Hubert Curien [Saint Etienne]
Document type :
Conference papers
Complete list of metadata
https://hal.inria.fr/hal-01388120
Contributor : Pierre-Louis Cayrel <>
Submitted on : Wednesday, October 26, 2016 - 3:09:24 PM
Last modification on : Monday, January 13, 2020 - 5:46:06 PM

Identifiers

  • HAL Id : hal-01388120, version 1

Collections

CNRS | UNIV-ST-ETIENNE | IOGS | PARISTECH | UDL

Citation

Pierre-Louis Cayrel, Khady Diagne, Cheikh T. Gueye. NP-completeness of the coset weight problem for quasi-dyadic codes. International Conference on Coding theory and Cryptography ICCC2015, Nov 2015, Alger, Algeria. ⟨hal-01388120⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

72

 

Contact                    Legal Notice                    Personal Data