scientific article; zbMATH DE number 1284419
From MaRDI portal
Publication:4242013
zbMATH Open0983.94056MaRDI QIDQ4242013FDOQ4242013
Publication date: 6 January 2002
Title of this publication is not available (Why is that?)
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
orthogonal polynomialsHamming spacepackingsuniversal boundsextremum problemspolynomial metric spacesJohnson spacepolynomial graphsbounds on extreme rootsdesigns in compact metric spacesduality in bounding optimal sizesparameters of codes in compact metric spaces
Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Other designs, configurations (05B30) Bounds on codes (94B65) General block designs in finite geometry (51E05)
Cited In (61)
- New upper bounds for spherical codes and packings
- The topology of projective codes and the distribution of zeros of odd maps
- Min-max polarization for certain classes of sharp configurations on the sphere
- The kissing number in 48 dimensions for codes with certain forbidden distances is 52 416 000
- Sum-of-squares hierarchies for binary polynomial optimization
- Sum-of-squares hierarchies for binary polynomial optimization
- Odd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentials
- A partial derandomization of phaselift using spherical designs
- One more proof of the first linear programming bound for binary codes and two conjectures
- On spherical codes with inner products in a prescribed interval
- Optimal measures for \(p\)-frame energies on spheres
- Note on the size of binary Armstrong codes
- Bounds for spherical codes: The Levenshtein framework lifted
- On the size of partial block designs with large blocks
- Flat tori, lattices and bounds for commutative group codes
- Многочлены Кравчука и их применения в задачах криптографии и теории кодирования
- Proceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001
- Spectral approach to linear programming bounds on codes
- Nonnegative quadratic forms and bounds on orthogonal polynomials
- Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes
- Lower bounds for projective designs, cubature formulas and related isometric embeddings
- POINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACES
- On zeros of discrete orthogonal polynomials
- On maximal antipodal spherical codes with few distances
- Bounds for codes by semidefinite programming
- Title not available (Why is that?)
- Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\)
- Energy on spheres and discreteness of minimizing measures
- Energy bounds for codes in polynomial metric spaces
- Linear programming bounds for covering radius of spherical designs
- High-dimensional sphere packing and the modular bootstrap
- A method for proving nonexistence of spherical designs of odd strength and odd cardinality
- On polarization of spherical codes and designs
- Turán inequalities for three-term recurrences with monotonic coefficients
- A new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designs
- A survey on spherical designs and algebraic combinatorics on spheres
- Polynomial techniques for investigation of spherical designs
- Upper energy bounds for spherical designs of relatively small cardinalities
- Riesz and Green energy on projective spaces
- Absolute minima of potentials of certain regular spherical configurations
- Bounds for discrepancies in the Hamming space
- Code spectrum and the reliability function: binary symmetric channel
- POINT DISTRIBUTIONS IN COMPACT METRIC SPACES
- Stolarsky's invariance principle for projective spaces
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Bounds for the sum of distances of spherical sets of small size
- ASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONS
- Great antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalities
- Integral points on elliptic curves and 3-torsion in class groups
- Upper bounds for packings of spheres of several radii
- On extreme zeros of classical orthogonal polynomials
- Universally optimal distribution of points on spheres
- Power-free values, large deviations, and integer points on irrational curves
- Energy bounds for codes and designs in Hamming spaces
- Bounds on antipodal spherical designs with few angles
- Majorization and Minimal Energy on Spheres
- Universal lower bounds for potential energy of spherical codes
- Nonexistence of a few binary orthogonal arrays
- Invariant Semidefinite Programs
- Upper bounds for energies of spherical codes of given cardinality and separation
- Investigation of binary orthogonal arrays via their distance distributions
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)
