"A NP-Complete Problem in Coding Theory with Application to Code Based ..."

Thierry P. Berger, Cheikh Thiécoumba Gueye, Jean Belo Klamti (2017)

> Home

Details and statistics

DOI: 10.1007/978-3-319-55589-8_15

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/c2si/BergerGK17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/c2si/BergerGK17
Thierry P. Berger, Cheikh Thiécoumba Gueye, Jean Belo Klamti:
A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography. C2SI 2017: 230-237

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.