Add to ORKGWe derive universal lower bounds for the potential energy of spherical codes, that are optimal in the framework of the standard linear programming approach. Our bounds are universal in the sense of both Levenshtein and Cohn and Kumar; i.e., they are valid for any choice of dimension and code cardinality and that they apply to any absolutely monotone potential
In this work we search for spherical codes in three to five dimensions using different global optimi...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
Based upon the works of Delsarte-Goethals-Seidel, Levenshtein, Yudin, and Cohn-Kumar we derive unive...
We derive and investigate lower bounds for the potential energy of finite spherical point sets (sphe...
We derive universal lower bounds for the potential energy of spherical codes and codes in Hamming sp...
We derive universal lower bounds for the potential energy of spherical codes, that are optimal in th...
Based upon the works of Delsarte-Goethals-Seidel, Levenshtein, Yudin, and Cohn-Kumar we derive unive...
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potenti...
Abstract. Three-point semidefinite programming bounds are one of the most powerful known tools for b...
A spherical code with parameter $(n, N,\gamma)$ is a set of N points on the unit sphere in $n$ dimen...
A spherical code with parameter $(n, N,\gamma)$ is a set of N points on the unit sphere in $n$ dimen...
We obtain universal bounds on the energy of codes and designs in Hamming spaces. Our bounds hold for...
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t)...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
In this work we search for spherical codes in three to five dimensions using different global optimi...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
Based upon the works of Delsarte-Goethals-Seidel, Levenshtein, Yudin, and Cohn-Kumar we derive unive...
We derive and investigate lower bounds for the potential energy of finite spherical point sets (sphe...
We derive universal lower bounds for the potential energy of spherical codes and codes in Hamming sp...
We derive universal lower bounds for the potential energy of spherical codes, that are optimal in th...
Based upon the works of Delsarte-Goethals-Seidel, Levenshtein, Yudin, and Cohn-Kumar we derive unive...
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potenti...
Abstract. Three-point semidefinite programming bounds are one of the most powerful known tools for b...
A spherical code with parameter $(n, N,\gamma)$ is a set of N points on the unit sphere in $n$ dimen...
A spherical code with parameter $(n, N,\gamma)$ is a set of N points on the unit sphere in $n$ dimen...
We obtain universal bounds on the energy of codes and designs in Hamming spaces. Our bounds hold for...
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t)...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
In this work we search for spherical codes in three to five dimensions using different global optimi...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...
Traditionally, optimality and uniqueness of an (n,N,t) spherical code is proved using linear program...