Content deleted Content added
m →Gilbert–Varshamov bound theorem: In the text "random generator matrix" means "generator matrix, which is chosen randomly. Therefore the link to Random Generator page relates to the word "random only" |
m clean up using AWB |
||
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. Gilbert–Varshamov bound is the best in term of relative distance for codes over alphabets of size less than 49.{{
==Gilbert–Varshamov bound theorem==
| |||