Zobrazeno 1 - 10
of 323
pro vyhledávání: '"Litsyn S"'
Publikováno v:
EURASIP Journal on Advances in Signal Processing, Vol 2011, Iss 1, p 59 (2011)
Externí odkaz:
https://doaj.org/article/a06cadb5203e4c338d1208df3ccc9988
Using algebraic geometry codes we give a polynomial construction of quantum codes with asymptotically non-zero rate and relative distance.
Comment: 15 pages, 1 figure
Comment: 15 pages, 1 figure
Externí odkaz:
http://arxiv.org/abs/quant-ph/0006061
Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the applicability of t
Externí odkaz:
http://arxiv.org/abs/math/9910175
In Part II we show that there exist quantum codes whose probability of undetected error falls exponentially with the length of the code and derive bounds on this exponent.The lower (existence) bound for stabilizer codes is proved by a counting argume
Externí odkaz:
http://arxiv.org/abs/quant-ph/9906131
Publikováno v:
In Electronic Notes in Discrete Mathematics 2001 6:211-219
Publikováno v:
In Electronic Notes in Discrete Mathematics 2001 6:4-14
Publikováno v:
Scopus-Elsevier
Using graph-theoretic methods we give a new proof that for all sufficiently large $n$, there exist sphere packings in $\R^n$ of density at least $cn2^{-n}$, exceeding the classical Minkowski bound by a factor linear in $n$. This matches up to a const
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9fe243401729619260ec596ff16d2adb
Publikováno v:
Codes and association schemes, 131-134
STARTPAGE=131;ENDPAGE=134;TITLE=Codes and association schemes
STARTPAGE=131;ENDPAGE=134;TITLE=Codes and association schemes
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::d8ea858c767dbaac256c0bb7b830ea23
https://research.tue.nl/nl/publications/a56f818e-bfaf-4cdd-9dcc-056b8f029fd3
https://research.tue.nl/nl/publications/a56f818e-bfaf-4cdd-9dcc-056b8f029fd3
Publikováno v:
2011 IEEE International Symposium on Information Theory Proceedings (ISIT); 2011, p6-10, 5p
Publikováno v:
2011 IEEE International Symposium on Information Theory Proceedings (ISIT); 2011, p484-488, 5p