Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate

Details Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate

2009-03-02

arxiv.org/abs/0903.0302v2

Computer Science

Information Theory

This submission has been withdrawn by author [arXiv admin]

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78197