Please use this identifier to cite or link to this item:
http://hdl.handle.net/20.500.12188/1266| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Spasov, Dejan | en_US |
| dc.contributor.author | Gusev, Marjan | en_US |
| dc.date.accessioned | 2019-01-14T12:52:08Z | - |
| dc.date.available | 2019-01-14T12:52:08Z | - |
| dc.date.issued | 2009-03-02 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/1266 | - |
| dc.description.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. | en_US |
| dc.relation.ispartof | Journal of Computing and Information Technology | en_US |
| dc.title | Asymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rate | en_US |
| dc.type | Article | en_US |
| item.fulltext | No Fulltext | - |
| item.grantfulltext | none | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| crisitem.author.dept | Faculty of Computer Science and Engineering | - |
| Appears in Collections: | Faculty of Computer Science and Engineering: Journal Articles | |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.