Gilbert–Varshamov Bound For Linear Codes

The Gilbert–Varshamov bound for linear codes is related to the general Gilbert–Varshamov bound, which gives a lower bound on the maximal number of elements in an error-correcting code of a given block length and minimum Hamming weight over a field $\mathbb_q$. This may be translated into a statement about the maximum rate of a code with given length and minimum distance. The Gilbert–Varshamov bound for linear codes asserts the existence of ''q''-ary linear codes for any relative minimum distance less than the given bound that simultaneously have high rate. The existence proof uses the probabilistic method, and thus is not constructive.
The Gilbert–Varshamov bound is the best known in terms of relative distance for codes over alphabets of size less than 49. For larger alphabets, algebraic geometry codes sometimes achieve an asymptotically better rate vs. distance tradeoff than is given by the Gilbert–Varshamov bound.

Gilbert–Varshamov bound theorem

:Theorem: Let $q \geqslant 2$. For every $0 \leqslant \delta < 1 - \tfrac$ and $0 < \varepsilon \leqslant 1 - H_q (\delta ),$ there exists a $q$-ary linear code with rate $R \geqslant 1 - H_q (\delta ) - \varepsilon$ and relative distance $\delta.$

Here $H_q$ is the ''q''-ary entropy function defined as follows:

: $H_q(x) = x\log_q(q-1)-x\log_qx-(1-x)\log_q(1-x).$

The above result was proved by Edgar Gilbert for general codes using the greedy method. Rom Varshamov refined the result to show the existence of a linear code. The proof uses the probabilistic method.

''High-level proof:''

To show the existence of the linear code that satisfies those constraints, the probabilistic method is used to construct the random linear code. Specifically, the linear code is chosen by picking a generator matrix $G \in \mathbb_q^$ whose entries are randomly chosen elements of $\mathbb_q$. The minimum Hamming distance of a linear code is equal to the minimum weight of a nonzero codeword, so in order to prove that the code generated by $G$ has minimum distance $d$, it suffices to show that for any $m \in \mathbb_q^k \smallsetminus \left\, \operatorname(mG) \ge d$. We will prove that the probability that there exists a nonzero codeword of weight less than $d$ is exponentially small in $n$. Then by the probabilistic method, there exists a linear code satisfying the theorem.

''Formal proof:''

By using the probabilistic method, to show that there exists a linear code that has a Hamming distance greater than $d$, we will show that the probability that the random linear code having the distance less than $d$ is exponentially small in $n$.

The linear code is defined by its generator matrix, which we choose to be a random $k \times n$ generator matrix; that is, a matrix of $kn$ elements which are chosen independently and uniformly over the field $\mathbb_q$.

Recall that in a linear code, the distance equals the minimum weight of a nonzero codeword. Let $\operatorname(y)$ be the weight of the codeword $y$. So

:
\begin
P & = \Pr_ (\text G\text < d) \\ pt& = \Pr_ (\text y \textG\text \operatorname(y) < d) \\ pt&= \Pr_ \left (\text 0 \neq m \in \mathbb_q^k \text \operatorname(mG) < d \right )
\end

The last equality follows from the definition: if a codeword $y$ belongs to a linear code generated by $G$, then $y = mG$ for some vector $m \in \mathbb_q^k$.

By Boole's inequality, we have:

: $P \leqslant \sum_ \Pr_ (\operatorname(mG) < d)$

Now for a given message $0 \neq m \in \mathbb_q^k,$ we want to compute

:$W = \Pr_ (\operatorname(mG) < d).$

Let $\Delta(m_1,m_2)$ be a Hamming distance of two messages $m_1$ and $m_2$. Then for any message $m$, we have: $\operatorname(m) = \Delta(0,m)$. Therefore:

: $W = \sum_ \Pr_ (mG = y)$

Due to the randomness of $G$, $mG$ is a uniformly random vector from $\mathbb_q^n$. So

:$\Pr_ (mG = y) = q^$

Let $\operatorname_q(r,n)$ be the volume of a Hamming ball with the radius $r$. Then:

: $P \leqslant q^k W = q^k \left ( \frac \right ) \leqslant q^k \left ( \frac \right ) = q^k q^$

By choosing $k = (1-H_q(\delta)-\varepsilon)n$, the above inequality becomes

: $P \leqslant q^$

Finally $q^ \ll 1$, which is exponentially small in n, that is what we want before. Then by the probabilistic method, there exists a linear code $C$ with relative distance $\delta$ and rate $R$ at least $(1-H_q(\delta)-\varepsilon)$, which completes the proof.

Comments

# The Varshamov construction above is not explicit; that is, it does not specify the deterministic method to construct the linear code that satisfies the Gilbert–Varshamov bound. A naive approach is to search over all generator matrices $G$ of size $kn$ over the field $\mathbb_q$ to check if the linear code associated to $G$ achieves the predicted Hamming distance. This exhaustive search requires exponential runtime in the worst case.
# There also exists a Las Vegas construction that takes a random linear code and checks if this code has good Hamming distance, but this construction also has an exponential runtime.
#For sufficiently large non-prime q and for certain ranges of the variable δ, the Gilbert–Varshamov bound is surpassed by the Tsfasman–Vladut–Zink bound.

See also

* Gilbert–Varshamov bound due to Gilbert construction for the general code
* Hamming bound
* Probabilistic method

References

Lecture 11: Gilbert–Varshamov Bound. Coding Theory Course. Professor Atri Rudra

Lecture 9: Bounds on the Volume of Hamming Ball. Coding Theory Course. Professor Atri Rudra

Coding Theory Notes: Gilbert–Varshamov Bound. Venkatesan Guruswami

{{DEFAULTSORT:Gilbert-Varshamov bound for linear codes
Coding theory