Minimum distance of a code
The problem for an arbitrary binary code is NP-hard. 

Reference: Alexander Vardy, &ldquo;The Intractability of Computing
the Minimum Distance of a Code,&rdquo; IEEE Trans. Inf. Thy., Vol. 43 pp. 1757--1766.