2000 character limit reached
Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate (0903.0302v2)
Published 2 Mar 2009 in cs.IT and 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.