Add to ORKGWe derive universal lower bounds for the potential energy of spherical codes and codes in Hamming spaces, that are optimal in the framework of Delsarte\u27s linear programming approach adapted for energy bounds by Yudin. Our bounds are universal in the sense of both Levenshtein and Cohn-Kumar; i.e., they are valid for any choice of dimension and code cardinality and they apply to any absolutely monotone potential
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...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
We derive universal lower bounds for the potential energy of spherical codes, that are optimal in th...
We derive and investigate lower bounds for the potential energy of finite spherical point sets (sphe...
Based upon the works of Delsarte-Goethals-Seidel, Levenshtein, Yudin, and Cohn-Kumar we derive unive...
We derive universal lower bounds for the potential energy of spherical codes, that are optimal in th...
We obtain universal bounds on the energy of codes and designs in Hamming spaces. Our bounds hold for...
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...
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For...
We study energy minimization for pair potentials among periodic sets in Euclidean spaces. We derive ...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
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...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...
We derive universal lower bounds for the potential energy of spherical codes, that are optimal in th...
We derive and investigate lower bounds for the potential energy of finite spherical point sets (sphe...
Based upon the works of Delsarte-Goethals-Seidel, Levenshtein, Yudin, and Cohn-Kumar we derive unive...
We derive universal lower bounds for the potential energy of spherical codes, that are optimal in th...
We obtain universal bounds on the energy of codes and designs in Hamming spaces. Our bounds hold for...
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...
ABSTRACT. We present an extension of the Delsarte linear programming method for spherical codes. For...
We study energy minimization for pair potentials among periodic sets in Euclidean spaces. We derive ...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
Abstract. The sphere packing problem asks for the greatest density of a packing of congruent balls i...
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...
In this paper we present a study of the linear programming technique developed by Delsarte, Goethal ...