Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/1266| Title: | Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate | Authors: | Spasov, Dejan Gusev, Marjan |
Issue Date: | 2-Mar-2009 | Journal: | Journal of Computing and Information Technology | 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. | URI: | http://hdl.handle.net/20.500.12188/1266 |
| Appears in Collections: | Faculty of Computer Science and Engineering: Journal Articles |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.