Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate
Journal
Journal of Computing and Information Technology
Date Issued
2009-03-02
Author(s)
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.
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.