Journal of Statistical Physics, Vol. 96, Nos. 3/4, 1999. p. 907-912.
We propose a method based on cluster expansion to study the optimal code with a given distance between codewords. Using this approach we find the Gilbert-Varshamov lower bound for the rate of largest code.