Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис: http://hdl.handle.net/20.500.12188/20308
Наслов: Some notes on the binary Gilbert-Varshamov bound
Authors: Spasov, Dejan 
Gushev, Marjan 
Issue Date: 2009
Journal: Sixth International Workshop on Optimal Codes and Related Topics, Varna, Bulgaria
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.
URI: http://hdl.handle.net/20.500.12188/20308
Appears in Collections:Faculty of Computer Science and Engineering: Conference papers

Files in This Item:
File Опис SizeFormat 
a29.pdf132.36 kBAdobe PDFView/Open
Прикажи целосна запис

Page view(s)

46
checked on 17.5.2024

Download(s)

16
checked on 17.5.2024

Google ScholarTM

Проверете


Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.