Given an alphabet of $q \ge 2$ letters, I want to construct a set $S$ of $x$ strings (of uniform length) such that the minimum Hamming distance between any two strings is $d$. What I need to figure out is the minimum string length $n$ that could produce such a set.


When $d = 1$, then $n = ceiling(log\_q(x))$, but I can't figure out how to find $n$ for an arbitrary value of $d > 1$.



How to find the minimum string length to produce a set of a given size with a minimum pairwise Hamming distance
For $q$ the size of the alphabet and $n$ the length of the code it is costumary to denote by 
$A\_q(n,d)$ the maximal size of a code with minimum distance $d$. 


There are numerous investigations on this. tergi already mentioned tables of explicit values. 
There are however also general bounds known. In particular a classical result is the Gilbert-Varshamov bound that says 
$$A\_q (n,d) \ge \frac{q^n}{\sum\_{j=0}^{d-1} C(n,j) (q-1)^j}$$
where by $C(n,j)$ I just mean the binomial coefficient but momentarily fail to typeset it properly.


This is not precisely what you need as you have some $x$ given that corresponds to the $A\_q(n,d)$ and need to find a suitable $n$. But for concrete values it would now be easy to solve your problem, and if you need explicit bounds they would (with some additional loss) also be obtainable.


Another question would be how to effectively construct the set then. (Depending on what you are trying to achieve there might be different things to consider.) Yet, without further details from you it is hard/impossible to know what type of information would be most useful. 


