scientific article; zbMATH DE number 1284419
From MaRDI portal
Publication:4242013
Recommendations
- scientific article; zbMATH DE number 503183
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- Energy bounds for codes in polynomial metric spaces
- scientific article; zbMATH DE number 2077080
Cited in
(61)- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- The topology of projective codes and the distribution of zeros of odd maps
- New upper bounds for spherical codes and packings
- Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials
- Min-max polarization for certain classes of sharp configurations on the sphere
- Sum-of-squares hierarchies for binary polynomial optimization
- Sum-of-squares hierarchies for binary polynomial optimization
- On the size of partial block designs with large blocks
- On zeros of discrete orthogonal polynomials
- POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES
- On maximal antipodal spherical codes with few distances
- Invariant Semidefinite Programs
- Upper bounds for energies of spherical codes of given cardinality and separation
- Bounds for discrepancies in the Hamming space
- Universally optimal distribution of points on spheres
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Flat tori, lattices and bounds for commutative group codes
- Investigation of binary orthogonal arrays via their distance distributions
- Turán inequalities for three-term recurrences with monotonic coefficients
- Upper bounds for packings of spheres of several radii
- Stolarsky's invariance principle for projective spaces
- One more proof of the first linear programming bound for binary codes and two conjectures
- Point distributions in compact metric spaces
- Krawtchouk polynomials and their applications in cryptography and coding theory
- Polynomial techniques for investigation of spherical designs
- Spectral approach to linear programming bounds on codes
- Nonnegative quadratic forms and bounds on orthogonal polynomials
- On spherical codes with inner products in a prescribed interval
- On extreme zeros of classical orthogonal polynomials
- Universal lower bounds for potential energy of spherical codes
- High-dimensional sphere packing and the modular bootstrap
- Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\)
- Energy bounds for codes in polynomial metric spaces
- A method for proving nonexistence of spherical designs of odd strength and odd cardinality
- Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities
- Code spectrum and the reliability function: binary symmetric channel
- Lower bounds for projective designs, cubature formulas and related isometric embeddings
- Energy on spheres and discreteness of minimizing measures
- Asymptotic linear programming lower bounds for the energy of minimizing Riesz and Gauss configurations
- Linear programming bounds for covering radius of spherical designs
- Optimal measures for \(p\)-frame energies on spheres
- Bounds for the sum of distances of spherical sets of small size
- Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes
- Integral points on elliptic curves and 3-torsion in class groups
- Nonexistence of a few binary orthogonal arrays
- Bounds for codes by semidefinite programming
- On polarization of spherical codes and designs
- Upper energy bounds for spherical designs of relatively small cardinalities
- A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs
- Energy bounds for codes and designs in Hamming spaces
- Note on the size of binary Armstrong codes
- Riesz and Green energy on projective spaces
- Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001
- Bounds on antipodal spherical designs with few angles
- A partial derandomization of phaselift using spherical designs
- Absolute minima of potentials of certain regular spherical configurations
- Power-free values, large deviations, and integer points on irrational curves
- Bounds for spherical codes: the Levenshtein framework lifted
- A survey on spherical designs and algebraic combinatorics on spheres
- scientific article; zbMATH DE number 7360437 (Why is no real title available?)
- Majorization and minimal energy on spheres
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4242013)
