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]
No reviews for this publication, yet.