Gilbert–Varshamov bound for linear codes: Difference between revisions

Revision as of 14:04, 25 May 2012

Revision as of 13:34, 3 September 2012

Line 1:

{{multiple issues|

{{Lead missing|date=May 2011}}

{{Cleanup|reason=the article is written in bad English |date=May 2012}}

{{Wikify|date=May 2012}}

{{Lead|lead missing|date = 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. More interestingly, Gilbert–Varshamov bound is the best in term of relative distance for codes over alphabets of size less than 49.