In coding theory, the Gilbert–Varshamov bound (due to Edgar Gilbert and independently Rom Varshamov ) is a bound on the size of a (not necessarily linear) code. It is occasionally known as the Gilbert–Shannon–Varshamov bound (or the GSV bound), but the name "Gilbert–Varshamov bound" is by far the most popular. Varshamov proved this bound by using the probabilistic method for linear codes. For more about that proof, see Gilbert–Varshamov bound for linear codes.

Statement of the bound

Recall that a code has a minimum distance d if any two elements in the code are at least a distance d apart. Let denote the maximum possible size of a q-ary code C with length n and minimum Hamming distance d (a q-ary code is a code over the field of q elements). Then:

Proof

Let C be a code of length n and minimum Hamming distance d having maximal size: Then for all, there exists at least one codeword c_x \in C such that the Hamming distance d(x,c_x) between x and c_x satisfies since otherwise we could add x to the code whilst maintaining the code's minimum Hamming distance d – a contradiction on the maximality of |C|. Hence the whole of is contained in the union of all balls of radius d-1 having their centre at some c \in C : Now each ball has size since we may allow (or choose) up to d-1 of the n components of a codeword to deviate (from the value of the corresponding component of the ball's centre) to one of (q-1) possible other values (recall: the code is q-ary: it takes values in ). Hence we deduce That is:

An improvement in the prime power case

For q a prime power, one can improve the bound to where k is the greatest integer for which