Revision as of 05:44, 27 May 2011 edit Michael Hardy (talk \| contribs) Administrators 210,597 edits →Gilbert–Varshamov bound theorem ← Previous edit		Revision as of 02:52, 28 May 2011 edit undo Michael Hardy (talk \| contribs) Administrators 210,597 edits The phrase "gv-linear-code does not ever appear in this article! Next edit →
Line 1: {{nointro}} 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.

Gilbert–Varshamov bound for linear codes: Difference between revisions