NP-completeness of the coset weight problem for quasi-dyadic codes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

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

Khady Diagne
  • Function : Author
Cheikh T. Gueye
  • Function : Author
No file

Dates and versions

hal-01388120 , version 1 (26-10-2016)

Identifiers

  • HAL Id : hal-01388120 , version 1

Cite

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⟩
43 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More