Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate
Information Theory
2009-03-12 v2 math.IT
Abstract
We compute the code parameters for binary linear codes obtained by greedy constructing the parity check matrix. Then we show that these codes improve the Gilbert-Varshamov (GV) bound on the code size and rate. This result counter proves the conjecture on the asymptotical exactness of the binary GV bound.
Keywords
Cite
@article{arxiv.0903.0302,
title = {Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate},
author = {Dejan Spasov and Marjan Gusev},
journal= {arXiv preprint arXiv:0903.0302},
year = {2009}
}
Comments
This submission has been withdrawn by author [arXiv admin]