Gilbert–Varshamov bound for linear codes: Difference between revisions

Revision as of 16:29, 2 January 2013

Revision as of 20:07, 29 May 2013

Line 3:

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

==Gilbert–Varshamov bound theorem==