|
|
| Line 1: |
Line 1: |
| {{multiple issues|
| | Plumbing Inspector Hagemann from Sainte-Catherine, spends time with passions such as wargames, health and fitness and canoeing. Gets inspiration through travel and just spent 3 weeks at Medina of Sousse.<br><br>Here is my web site; [http://gymnastic-classifieds.com/ads/put-on-more-dimensions-with-this-particular-weight-gain-guidance/ best weight gainer To Build muscle] |
| {{Cleanup|reason=the article is written in bad English |date=May 2012}}
| |
| |lead missing = May 2011}}
| |
| | |
| In [[coding theory]], the bound of parameters such as rate ''R'', relative distance, [[block length]], etc. is usually concerned. Here [[Gilbert–Varshamov bound|Gilbert–Varshamov bound theorem]] claims the lower bound of the rate of the general code. Gilbert–Varshamov bound is the best in term of relative distance for codes over alphabets of size less than 49.{{fact|date=May 2013}}
| |
| | |
| ==Gilbert–Varshamov bound theorem==
| |
| | |
| '''Theorem:''' Let <math>q \ge 2</math>. For every <math>0 \le \delta < 1 - \frac{1}{q}</math>, and <math>0 < \varepsilon \le 1 - H_q (\delta )</math>, there exists a code with rate <math>R \ge 1 - H_q (\delta ) - \varepsilon </math>, and relative distance <math>\delta</math>.
| |
| | |
| Here <math>H_q</math> is the ''q''-ary entropy function defined as follows:
| |
| | |
| : <math>H_q(x) = x\log_q(q-1)-x\log_qx-(1-x)\log_q(1-x).</math>
| |
| | |
| The above result was proved by [[Edgar Gilbert]] for general code using the [[greedy method]] as [[Gilbert–Varshamov bound|here]]. For [[linear code]], Varshamov proved using the [[probabilistic method]] for the random linear code. This proof will be shown in the following part.
| |
| | |
| '''''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 randomly by choosing the [[random generator|random]] generator matrix <math>G</math> in which the element is chosen uniformly over the field <math>\mathbb{F}_q^n </math>. Also the [[Hamming distance]] of the linear code is equal to the minimum weight of the [[codeword]]. So to prove that the linear code generated by <math>G</math> has Hamming distance <math>d</math>, we will show that for any <math>m \in \mathbb{F}_q^k \backslash \left\{ 0 \right\}, wt(mG) \ge d</math> . To prove that, we prove the opposite one; that is, the probability that the linear code generated by <math>G</math> has the Hamming distance less than <math>d</math> is exponentially small in <math>n</math>. Then by probabilistic method, there exists the 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 <math>d</math>, we will show that the [[probability]] that the random linear code having the distance less than <math>d</math> is exponentially small in <math>n</math>.
| |
| | |
| We know that the linear code is defined using the [[generator matrix]]. So we use the "random generator matrix" <math>G</math> as a mean to describe the randomness of the linear code. So a random generator matrix <math>G</math> of size <math>kn</math> contains <math>kn</math> elements which are chosen independently and uniformly over the field <math>\mathbb{F}_q</math>.
| |
| | |
| Recall that in a linear code, the distance = the minimum weight of the non-zero codeword. This fact is one of the [[Linear code|properties of linear code]].
| |
| | |
| Denote <math>wt(y)</math> be the weight of the codeword <math>y</math>.
| |
| So
| |
| | |
| : <math>
| |
| \begin{align}
| |
| P & = {\Pr}_{\text{random }G} [\text{linear code generated by }G\text{ has distance} < d] \\
| |
| & = {\Pr}_{\text{random }G} [\text{there exists a codeword }y \ne 0\text{ in a linear code generated by }G\text{ such that }\mathrm{wt}(y) < d]
| |
| \end{align}
| |
| </math>
| |
| | |
| Also if codeword <math>y</math> belongs to a linear code generated by <math>G</math>, then <math>y = mG</math> for some vector <math>m \in \mathbb{F}_q^k</math>.
| |
| | |
| Therefore <math>P = {\Pr}_{\text{random }G} [\text{there exists a vector }m \in \mathbb{F}_q^k \backslash \{ 0\}\text{ such that }wt(mG) < d]</math>
| |
| | |
| By [[Boole's inequality]], we have:
| |
| | |
| : <math>P \le \sum\limits_{m \in \mathbb{F}_q^k \backslash \{ 0\} } {{\Pr}_{\text{random }G} } [wt(mG) < d]</math> | |
| | |
| Now for a given message <math>m \in \mathbb{F}_q^k \backslash \{ 0\}</math>, we want to compute <math>W = {\Pr}_{\text{random }G} [wt(mG) < d]</math>
| |
| | |
| Denote <math>\Delta(m_1,m_2)</math> be a Hamming distance of two messages <math>m_1</math> and <math>m_2</math>
| |
| | |
| Then for any message <math>m</math>, we have: <math>wt(m) = \Delta(0,m)</math>.
| |
| | |
| Using this fact, we can come up with the following equality:
| |
| | |
| : <math>W = \sum\limits_{\text{all }y \in \mathbb{F}_q^n \text{s.t. }\Delta (0,y) \le d - 1} {{\Pr}_{\text{random }G} [mG = y]}</math>
| |
| | |
| Due to the randomness of <math>G</math>, <math>mG</math> is a uniformly random vector from <math>\mathbb{F}_q^n</math>.
| |
| | |
| So <math>{\Pr}_{\text{random }G} [mG = y] = q^{ - n}</math>
| |
| | |
| Let <math>\text{Vol}_q(r,n)</math> is a volume of Hamming ball with the radius <math>r</math>. Then:
| |
| | |
| : <math>W = \frac{\text{Vol}_q(d-1,n)}{q^n} \le \frac{\text{Vol}_q(\delta n,n)}{q^n} \le \frac{q^{nH_q(\delta)}}{q^n}</math>
| |
| | |
| (The later inequality comes from [http://www.cse.buffalo.edu/~atri/courses/coding-theory/lectures/lect9.pdf the upper bound of the Volume of Hamming ball])
| |
| | |
| Then
| |
| | |
| : <math> P \le q^k \cdot W \le q^k \frac{q^{nH_q(\delta)}}{q^n} = q^k q^{-n(1-H_q(\delta))}</math>
| |
| | |
| By choosing <math>k = (1-H_q(\delta)-\varepsilon)n</math>, the above inequality becomes
| |
| | |
| : <math> P \le q^{-\varepsilon n}</math>
| |
| | |
| Finally <math>q^{ - \varepsilon n} \ll 1</math>, which is exponentially small in n, that is what we want before. Then by the probabilistic method, there exists a linear code <math>C</math> with relative distance <math>\delta</math> and rate <math>R</math> at least <math>(1-H_q(\delta)-\varepsilon)</math>, 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. The naive way that we can do is to go over all the generator matrices <math>G</math> of size <math>kn</math> over the field <math>\mathbb{F}_q</math> and check if that linear code has the satisfied Hamming distance. That leads to the exponential time algorithm to implement it.
| |
| # We also have a [[Las Vegas algorithm|Las Vegas construction]] that takes a random linear code and checks if this code has good Hamming distance. Nevertheless, this construction has the exponential running time.
| |
| | |
| ==See also==
| |
| # [[Gilbert–Varshamov bound|Gilbert–Varshamov bound due to Gilbert construction for the general code]]
| |
| # [[Hamming bound|Hamming Bound]]
| |
| # [[Probabilistic method]]
| |
| | |
| ==References==
| |
| # [http://www.cse.buffalo.edu/~atri/courses/coding-theory/ Lecture 11: Gilbert–Varshamov Bound. Coding Theory Course. Professor Atri Rudra]
| |
| # [http://www.cse.buffalo.edu/~atri/courses/coding-theory/lectures/lect9.pdf Lecture 9: Bounds on the Volume of Hamming Ball. Coding Theory Course. Professor Atri Rudra]
| |
| # [http://www.cs.cmu.edu/~venkatg/teaching/codingtheory/ Coding Theory's Notes: Gilbert–Varshamov Bound. Venkatesan �Guruswami]
| |
| | |
| [[Category:Coding theory]]
| |
Plumbing Inspector Hagemann from Sainte-Catherine, spends time with passions such as wargames, health and fitness and canoeing. Gets inspiration through travel and just spent 3 weeks at Medina of Sousse.
Here is my web site; best weight gainer To Build muscle