Strengthening the GilbertβVarshamov boun
β
Alexander Barg; Sugi Guritman; Juriaan Simonis
π
Article
π
2000
π
Elsevier Science
π
English
β 86 KB
The paper discusses some ways to strengthen (nonasymptotically) the Gilbert-Varshamov bound for linear codes. The unifying idea is to study a certain graph constructed on vectors of low weight in the cosets of the code, which we call the Varshamov graph. Various simple estimates of the number of its