Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис:
http://hdl.handle.net/20.500.12188/20308| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Spasov, Dejan | en_US |
| dc.contributor.author | Gushev, Marjan | en_US |
| dc.date.accessioned | 2022-07-04T09:10:45Z | - |
| dc.date.available | 2022-07-04T09:10:45Z | - |
| dc.date.issued | 2009 | - |
| dc.identifier.uri | http://hdl.handle.net/20.500.12188/20308 | - |
| dc.description.abstract | Given a linear code [n, k, d] with parity check matrix H, we provide inequality that supports existence of a code with parameters [n + l + 1, k + l, d]. We show that this inequality is stronger than the Gilbert-Varshamov (GV) bound even if the existence of the code [n, k, d] is guaranteed by the GV bound itself. | en_US |
| dc.relation.ispartof | Sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria | en_US |
| dc.title | Some notes on the binary Gilbert-Varshamov bound | en_US |
| dc.type | Journal Article | en_US |
| item.fulltext | With Fulltext | - |
| item.grantfulltext | open | - |
| 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: Conference papers | |
Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.