The intractability of computing the minimum distance of a code

A. Vardy
1997 IEEE Transactions on Information Theory  
It is shown that the problem of computing the minimum distance of a binary linear code is NP-hard, and the corresponding decision problem is NP-complete. This result constitutes a proof of the conjecture of Berlekamp, McEliece, and van Tilborg, dating back to 1978. Extensions and applications of this result to other problems in coding theory are discussed.
doi:10.1109/18.641542 fatcat:tn6dlz2fk5cufl6mnfl6zzwqnu