0
$\begingroup$

Suppose I have a set of $d$-length binary strings $S = \{0,1\}^{k\times d}$. How can construct a new string of $d$-length so that the minimum hamming distance w.r.t. the strings in $S$ is maximized?

$\endgroup$
  • $\begingroup$ Does $S$ have any special structure, e.g. is it a linear code? $\endgroup$ – Batman Apr 3 '15 at 14:23
  • $\begingroup$ No structures. Maybe the assumption that $2^d >> k$. $\endgroup$ – Adam I. Apr 3 '15 at 14:43

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.