This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite programming. With this method we improve the previous bounds for the kissing number in several dimensions, as well as other classical problems like Tammes’ problem
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
AbstractIn this paper, we apply the semidefinite programming approach developed in [C. Bachoc, F. Va...
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...
htmlabstractWe apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obt...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In t...
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For...
htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlap...
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...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
AbstractIn this paper, we apply the semidefinite programming approach developed in [C. Bachoc, F. Va...
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...
htmlabstractWe apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obt...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new uppe...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In t...
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For...
htmlabstractThe kissing number in n-dimensional Euclidean space is the maximal number of non-overlap...
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...
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit sp...
We present an extension of known semidefinite and linear programming upper bounds for spherical code...
DOI
Add to ORKG