Add to ORKGIn this paper we present a study of the linear programming technique developed by Delsarte, Goethal and Seidel to find upper bounds on the size of spherical A-codes. Applications of spherical codes to kissing numbers, equiangular lines and the 24-cell are investigated. We develop a software package to find upper bounds for spherical A-codes and we investigate interesting results obtained from this software
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite progr...
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For...
This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite p...
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...
International audienceWe give a short review of existing mathematical programming based bounds for k...
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t)...
We present new upper bounds on the size of constant-weight binary codes, derived from bounds for sph...
International audienceWe give a short review of existing mathematical programming based bounds for k...
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...
In this work we search for spherical codes in three to five dimensions using different global optimi...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite progr...
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For...
This paper develops a new method to obtain upper bounds for spherical codes, based on semidefinite p...
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...
International audienceWe give a short review of existing mathematical programming based bounds for k...
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t)...
We present new upper bounds on the size of constant-weight binary codes, derived from bounds for sph...
International audienceWe give a short review of existing mathematical programming based bounds for k...
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...
In this work we search for spherical codes in three to five dimensions using different global optimi...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
A spherical code is a finite set of points on the surface of a multidimensional unit radius sphere. ...
htmlabstractRecently A. Schrijver derived new upper bounds for binary codes using semidefinite progr...