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

Simple item page
dc.creatorSpasov, Dejan
dc.creatorGusev, Marjan
dc.date2009-03-02
dc.date2009-03-11
dc.date.accessioned2026-07-07T12:51:32Z
dc.date.available2026-07-07T12:51:32Z
dc.descriptionWe 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.
dc.descriptionThis submission has been withdrawn by author [arXiv admin]
dc.identifierhttps://arxiv.org/abs/0903.0302
dc.identifierhttp://arxiv.org/abs/0903.0302
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/223017
dc.subjectInformation Theory
dc.titleAsymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate
dc.typetext

Files

Collections

arXiv