Home | Repositories | Statistics | About





Year: 2009


Type: Article



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


Author: Spasov, Dejan
Author: Gusev, Marjan



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.


Publisher:


Relation: Journal of Computing and Information Technology



Identifier: oai:repository.ukim.mk:20.500.12188/1266
Identifier: http://hdl.handle.net/20.500.12188/1266



TitleDateViews
Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate200914