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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
This submission has been withdrawn by author [arXiv admin]

Keywords

Information Theory

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/223017

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0903.0302
 http://arxiv.org/abs/0903.0302

Collections

arXiv