Answers are grounded in this paper and cite their sources.
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 (1978). Extensions and applications of this result to other problems in coding theory are discussed.
No takes yet. Share an insight, caveat, or question.
Alexander Vardy (1997) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: