\(\mathcal{NP}\)-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem
From MaRDI portal
Publication:725962
DOI10.1504/IJICOT.2017.10005835zbMath1407.94189MaRDI QIDQ725962
Pierre-Louis Cayrel, Mbouye Khady Diagne, Cheikh Thiecoumba Gueye
Publication date: 2 August 2018
Published in: International Journal of Information and Coding Theory (Search for Journal in Brave)
syndrome decoding problem\(\mathcal{NP}\)-completefour dimensional matching problemquasi-dyadic Goppa codes
This page was built for publication: \(\mathcal{NP}\)-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem