Gilbert–Varshamov bound for linear codes: Difference between revisions

Revision as of 21:01, 25 May 2014

Revision as of 12:30, 7 January 2015

Line 1:

{{multiple issues|

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

|{{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. Gilbert–Varshamov bound is the best in term of relative distance for codes over alphabets of size less than 49.{{citation needed|date=May 2013}}