Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.authorSpasov, Dejanen_US
dc.contributor.authorGusev, Marjanen_US
dc.description.abstractWe 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.ispartofJournal of Computing and Information Technologyen_US
dc.titleAsymptotic Improvement of the Binary Gilbert-Varshamov Bound on the Code Rateen_US
item.fulltextNo Fulltext- of Computer Science and Engineering- of Computer Science and Engineering-
Appears in Collections:Faculty of Computer Science and Engineering: Journal Articles
Show simple item record

Page view(s)

checked on May 29, 2023

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.