Gilbert–Varshamov bound for linear codes: Difference between revisions

Revision as of 01:06, 9 May 2011

Revision as of 01:07, 9 May 2011

Line 1:

{{lead missing|date=May 2011}}

==Introduction==

In [[coding theory]], the bound of parameters such as rate <math>R</math>, 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. More interestingly, Gilbert-Varshamov bound is the best in term of relative distance for codes over alphabets of size less than 49.