Gilbert–Varshamov bound for linear codes: Difference between revisions

Revision as of 18:57, 15 August 2018

Revision as of 10:42, 30 January 2019

Line 1:

{{technical|date=January 2019}}

{{multiple issues|

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

{{lead missing|date=May 2011}}

}}

The '''Gilbert-Varshamov bound for linear codes''' is related to the general [[Gilbert–Varshamov bound]], which gives a lower bound on the maximal number of elements in an [[Error correction code|error-correcting code]] of a given block length and minimum [[Hamming weight]] over a [[field (mathematics)|field]] <math>\mathbb{F}_q</math>. This may be translated into a statement about the maximum rate of a code with given length and minimum distance. The Gilbert–Varshamov bound for [[linear code|linear codes]] asserts the existence of ''q''-ary linear codes for any relative minimum distance less than the given bound that simultaneously have high rate. The existence proof uses [[probabilistic method]], and thus is not constructive.