NP-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem

DOI10.1504/IJICOT.2017.10005835MaRDI QIDQ725962zbMATH OpenFDO

Authors Pierre-Louis Cayrel, Mbouye Khady Diagne, Cheikh T. Gueye

Publication date 2 August 2018

Published in International Journal of Information and Coding Theory (Search for Journal in Brave)

zbMATH Keywords

syndrome decoding problem\(\mathcal{NP}\)-completefour dimensional matching problemquasi-dyadic Goppa codes

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• NP-completeness of the random binary quasi-dyadic coset weight problem and the random binary quasi-dyadic subspace weight problem
• Some new NP-complete coding problems
• scientific article; zbMATH DE number 1759341
• A NP-complete problem in coding theory with application to code based cryptography
• An algorithm for generalized syndrome decoding problem

Cited in

(3)

• NP-completeness of the random binary quasi-dyadic coset weight problem and the random binary quasi-dyadic subspace weight problem
• A NP-complete problem in coding theory with application to code based cryptography
• On the hardness of the Lee syndrome decoding problem

This page was built for publication: \(\mathcal{NP}\)-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725962)