Add to ORKGRecently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases n = 3, 4, 8, 24
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In t...
htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite progr...
htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite progr...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlap...
This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite p...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
AbstractIn this paper, we apply the semidefinite programming approach developed in [C. Bachoc, F. Va...
AbstractIn this paper, we apply the semidefinite programming approach developed in [C. Bachoc, F. Va...
International audienceWe give a short review of existing mathematical programming based bounds for k...
htmlabstractWe apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obt...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In t...
htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite progr...
htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite progr...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlap...
This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite p...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
AbstractIn this paper, we apply the semidefinite programming approach developed in [C. Bachoc, F. Va...
AbstractIn this paper, we apply the semidefinite programming approach developed in [C. Bachoc, F. Va...
International audienceWe give a short review of existing mathematical programming based bounds for k...
htmlabstractWe apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obt...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...