相关论文: Upper bounds for energies of spherical codes of gi…
New bounds on the cardinality of permutation codes equipped with the Ulam distance are presented. First, an integer-programming upper bound is derived, which improves on the Singleton-type upper bound in the literature for some lengths.…
We Use the method of linearly independent polynomials to derive an upper bound for the cardinality of a spherical s-distance set F where the sum of distinct inner products of any two elements from F is zero. Our result generalizes the…
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular,…
Using the auxiliary field method, a generic upper bound is obtained for the spinless Salpeter equation with two different masses. Analytical results are presented for the cases of the Coulomb and linear potentials when a mass is vanishing.
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…
A complex spherical code is a finite subset on the unit sphere in $\mathbb{C}^d$. A fundamental problem on complex spherical codes is to find upper bounds for those with prescribed inner products. In this paper, we determine the irreducible…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
We design a heuristic method, a genetic algorithm, for the computation of an upper bound of the minimum distance of a linear code over a finite field. By the use of the row reduced echelon form, we obtain a permutation encoding of the…
In this paper, we use the linear programming approach to find new upper bounds for the moments of isotropic measures. These bounds are then utilized for finding lower packing bounds and energy bounds for projective codes. We also show that…
This article is devoted to the study of discrete potentials on the sphere in $\mathbb{R}^n$ for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in…
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…
We derive an upper limit to the energy of nuclei accelerated via the Fermi mechanism in any relativistic shockwave, driven by any astrophysical engine. This bound is accessible to current and upcoming ultra-high energy neutrino experiments.…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
Energy bounds which are uniform in the background metric are obtained from upper bounds for entropy-like quantities. The argument is based on auxiliary Monge-Amp\`ere equations involving sublevel sets, and bypasses the…
We construct energy-dependent potentials for which the Schroedinger equations admit solu- tions in terms of exceptional orthogonal polynomials. Our method of construction is based on certain point transformations, applied to the equations…
New lower bounds on the minimum average Hamming distance of binary codes are derived. The bounds are obtained using linear programming approach.
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…