Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Dodunekov, Stefan"'
Publikováno v:
Serdica Math. J., vol. 38 (2012), pp. 507-522
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in $n$ dimensions is called kissing number. The problem for finding kissing numbers is closely connected to the more general problems of finding bounds for spher
Externí odkaz:
http://arxiv.org/abs/1507.03631
Publikováno v:
European J. Combin., 31 (6) (2010), 1611-1616
In this paper, we show that a set of q+a hyperplanes, q>13, a<(q-10)/4, that does not cover PG(n,q), does not cover at least q^(n-1)-aq^(n-2) points, and show that this lower bound is sharp. If the number of non- covered points is at most q^(n-1), th
Externí odkaz:
http://arxiv.org/abs/1210.1002
Publikováno v:
IEEE Transactions on Information Theory, vol. 54, issue 9, pp. 4335-4339, 2008
The aim of this work is a systematic investigation of the possible parameters of quasi-perfect (QP) binary and ternary linear codes of small dimensions and preparing a complete classification of all such codes. First we give a list of infinite famili
Externí odkaz:
http://arxiv.org/abs/0712.1465
The maximum possible number of non-overlapping unit spheres that can touch a unit sphere in n dimensions is called kissing number. The problem for finding kissing numbers is closely connected to the more general problems of finding bounds for spheric
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::124bfa297b02fa2aafb3d83b371e2cfd
https://hdl.handle.net/10525/3489
https://hdl.handle.net/10525/3489
The NATO Advanced Research Workshop on Enhancing Cryptographic Primitives with Techniques from Error Correcting Codes has been organized in Veliko Tarnovo, Bulgaria, on October 6-9, 2008 by the Institute of Mathematics and Informatics of the Bulgaria
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::6f088700a0966071b4c90f6bf2455fa8
https://research.utwente.nl/en/publications/ff3704b1-e0df-4f20-95dd-7e3aa64a6e70
https://research.utwente.nl/en/publications/ff3704b1-e0df-4f20-95dd-7e3aa64a6e70
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dodunekov, Stefan, Guritman, Sugi
Publikováno v:
IEEE Transactions on Information Theory. Nov99, Vol. 45 Issue 7, p2543. 4p.
Publikováno v:
IEEE Transactions on Information Theory. Nov97, Vol. 43 Issue 6, p2023. 4p.
Publikováno v:
IEEE Transactions on Information Theory. Jan97, Vol. 43 Issue 1, p285. 6p. 1 Chart.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.