Cite
HARVARD Citation
Cayrel, P. et al. (2017). NP-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem. International journal of information and coding theory. pp. 276-288. [Online].
This is an interim version of our Electronic Legal Deposit Catalogue-eJournals and eBooks while we continue to recover from a cyber-attack.
Cayrel, P. et al. (2017). NP-completeness of the Goppa parameterised random binary quasi-dyadic syndrome decoding problem. International journal of information and coding theory. pp. 276-288. [Online].