scientific article; zbMATH DE number 1284419

From MaRDI portal
Publication:4242013

zbMath0983.94056MaRDI QIDQ4242013

Vladimir I. Levenshtein

Publication date: 6 January 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (57)

Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\)Optimal measures for \(p\)-frame energies on spheresHigh-dimensional sphere packing and the modular bootstrapGreat antipodal sets on complex Grassmannian manifolds as designs with the smallest cardinalitiesOne more proof of the first linear programming bound for binary codes and two conjecturesUnnamed ItemAbsolute minima of potentials of certain regular spherical configurationsOdd strength spherical designs attaining the Fazekas-Levenshtein bound for covering and universal minima of potentialsSpectral approach to linear programming bounds on codesCode spectrum and the reliability function: binary symmetric channelRiesz and Green energy on projective spacesBounds for the sum of distances of spherical sets of small sizeUpper bounds for energies of spherical codes of given cardinality and separationProceedings of the conference on finite geometries, Oberwolfach, Germany, December 2--7, 2001POINT DISTRIBUTIONS IN COMPACT METRIC SPACESOn polarization of spherical codes and designsNote on the size of binary Armstrong codesUpper energy bounds for spherical designs of relatively small cardinalitiesOn spherical codes with inner products in a prescribed intervalPower-free values, large deviations, and integer points on irrational curvesМногочлены Кравчука и их применения в задачах криптографии и теории кодированияOn maximal antipodal spherical codes with few distancesUniversal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codesEnergy bounds for codes and designs in Hamming spacesNonexistence of a few binary orthogonal arraysInvestigation of binary orthogonal arrays via their distance distributionsOn extreme zeros of classical orthogonal polynomialsNonnegative quadratic forms and bounds on orthogonal polynomialsA new asymptotic bound of the minimum possible odd cardinality of spherical \((2k-1)\)-designsEnergy on spheres and discreteness of minimizing measuresTurán inequalities for three-term recurrences with monotonic coefficientsRefinements of Levenshtein bounds in \(q\)-ary Hamming spacesStolarsky's invariance principle for projective spacesUniversal lower bounds for potential energy of spherical codesInvariant Semidefinite ProgramsLinear programming bounds for covering radius of spherical designsA method for proving nonexistence of spherical designs of odd strength and odd cardinalityBounds for codes by semidefinite programmingBounds for discrepancies in the Hamming spaceSum-of-squares hierarchies for binary polynomial optimizationOn zeros of discrete orthogonal polynomialsFlat tori, lattices and bounds for commutative group codesPolynomial techniques for investigation of spherical designsSum-of-squares hierarchies for binary polynomial optimizationBounds on antipodal spherical designs with few anglesIntegral points on elliptic curves and 3-torsion in class groupsLower bounds for projective designs, cubature formulas and related isometric embeddingsPOINT DISTRIBUTIONS IN TWO‐POINT HOMOGENEOUS SPACESEnergy bounds for codes in polynomial metric spacesA survey on spherical designs and algebraic combinatorics on spheresUpper bounds for packings of spheres of several radiiUniversally optimal distribution of points on spheresMajorization and Minimal Energy on SpheresASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONSBounds for spherical codes: The Levenshtein framework liftedA partial derandomization of phaselift using spherical designsOn the size of partial block designs with large blocks




This page was built for publication: