Christian Wieschebrink. Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography. In Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006. pages 1733-1737, IEEE, 2006. [doi]
@inproceedings{Wieschebrink06-0,
title = {Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography},
author = {Christian Wieschebrink},
year = {2006},
doi = {10.1109/ISIT.2006.261651},
url = {https://doi.org/10.1109/ISIT.2006.261651},
researchr = {https://researchr.org/publication/Wieschebrink06-0},
cites = {0},
citedby = {0},
pages = {1733-1737},
booktitle = {Proceedings 2006 IEEE International Symposium on Information Theory, ISIT 2006, The Westin Seattle, Seattle, Washington, USA, July 9-14, 2006},
publisher = {IEEE},
isbn = {1-4244-0504-1},
}