From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Further results on the covering radius of codes.

G. Cohen, A. Lobstein, и N. Sloane. IEEE Trans. Inf. Theory, 32 (5): 680-694 (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Linear intersecting codes.G. Cohen, и A. Lempel. Discret. Math., 56 (1): 35-43 (1985)Write-isolated memories (WIMs).G. Cohen, и G. Zémor. Discret. Math., 114 (1-3): 105-113 (1993)On tilings of the binary vector space.G. Cohen, и P. Frankl. Discret. Math., 31 (3): 271-277 (1980)Projective codes which satisfy the chain condition.S. Encheva, и G. Cohen. Appl. Math. Lett., 13 (4): 109-113 (2000)On Linear Projective Codes Which Satisfy the Chain Condition.S. Encheva, и G. Cohen. Inf. Sci., 118 (1-4): 213-222 (1999)Variations on Minimal Linear Codes.G. Cohen, и S. Mesnager. ICMCTA, том 3 из CIM Series in Mathematical Sciences, стр. 125-131. Springer, (2014)Yet another variation on minimal linear codes.G. Cohen, S. Mesnager, и H. Randriam. ITA, стр. 329-330. IEEE, (2015)Maximum weight spectrum codes with reduced length.G. Cohen, и L. Tolhuizen. CoRR, (2018)On the Density of Best Coverings in Hamming Spaces.M. Beveraggi, и G. Cohen. Coding Theory and Applications, том 311 из Lecture Notes in Computer Science, стр. 39-44. Springer, (1986)Binary Codes for Collusion-Secure Fingerprinting.G. Cohen, S. Litsyn, и G. Zémor. ICISC, том 2288 из Lecture Notes in Computer Science, стр. 178-185. Springer, (2001)