## A graph-theoretic derivation of the Gilbert-Varshamov bound

Just a quick note for my reference, but it may be of interest to others.

Let denote the size of the largest code over a -ary alphabet that has blocklength and minimum distance . The well-known Gilbert-Varshamov bound says that

where

is the volume of a Hamming ball of radius in . The usual way of arriving at the GV bound is through a greedy construction: pick an arbitrary codeword , then keep adding codewords that are at Hamming distance of at least from all codewords that have already been picked. When this procedure terminates, the complement of the union of the Hamming balls of radius around each of the codewords should be empty — otherwise, you will have at least one more codeword at distance of at least from the ones already picked, and this would mean that the procedure could not have terminated.

As it turns out, there is another way of deriving the GV bound using graph theory that I have learned from a nice paper by Van Vu and Lei Wu. They use this graph-theoretic interpretation to arrive at an asymptotic improvement of the GV bound. Their result, which I will not go into here, extends an earlier result by Tao Jiang and Alex Vardy for binary codes. As far as I can tell, the graph-theoretic ideas go back to the Jiang-Vardy paper as well.

In order to proceed, we need some definitions and a lemma. Let be an undirected graph. A set of vertices is called *independent* if no two vertices in are connected by an edge. The *independence number* of , denoted by , is the cardinality of the largest independent set. The following lemma is folklore in graph theory:

Lemma 1Suppose that is -regular, i.e., every vertex has exactly neighbors. Then

*Proof:* Let be a maximal independent set. Any vertex is connected by an edge to at least one , because otherwise would have to be included in , which would contradict maximality. Therefore, there are at least edges with one vertex in and another vertex in . On the other hand, because is -regular, there can be at most such edges. This means that

Rearranging, we get (1).

Now let us construct the following graph (what Jiang and Vardy call the *Gilbert graph*): associate a vertex to each word in , and connect two vertices by an edge if and only if the Hamming distance between the corresponding words is at most . This graph has vertices, and each vertex has degree . Moreover, there is a one-to-one correspondence between independent sets of vertices and -ary codes of length and minimum distance at least , and the independence number of the Gilbert graph is equal to . The bound (1) is then precisely the GV bound.

Briefly, the Vu-Wu improvement of the GV bound exploits the deep fact that, when the neighborhood of any vertex in a -regular graph is very sparse (in the sense that it has a lot fewer than edges), the lower bound (1) can be significantly tightened. Apparently, actually counting the number of edges in such a neighborhood of any vertex of the Gilbert graph (by regularity, we may as well look at the neighborhood of the all-zero word) is rather complicated; Vu and Wu instead look at a suitable asymptotic regime when is large and for some and replace exact combinatorial bounds by entropy bounds.

4comments