scientific article; zbMATH DE number 3543912
From MaRDI portal
Publication:4119093
zbMath0348.94016MaRDI QIDQ4119093
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (61)
Upper bounds for the cardinality of s-distances codes ⋮ Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\) ⋮ Symmetry in Mathematical Programming ⋮ Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems ⋮ Dual codes of systematic group codes over abelian groups ⋮ A direct approach to linear programming bounds for codes and tms-nets ⋮ Quasi-symmetric designs and codes meeting the Grey-Rankin bound ⋮ Improved Delsarte bounds for spherical codes in small dimensions ⋮ A note on the stability number of an orthogonality graph ⋮ High-dimensional sphere packing and the modular bootstrap ⋮ Three-point bounds for energy minimization ⋮ On kissing numbers and spherical codes in high dimensions ⋮ Parity check systems of nonlinear codes over finite commutative Frobenius rings ⋮ Unnamed Item ⋮ Algebraic theory of block codes detecting independent errors ⋮ On non-full-rank perfect codes over finite fields ⋮ Sphere packing bounds via spherical codes ⋮ Unique optima of the Delsarte linear program ⋮ Delsarte’s extremal problem and packing on locally compact Abelian groups ⋮ On distance distributions of orthogonal arrays ⋮ On perfect 2-colorings of the \(q\)-ary \(n\)-cube ⋮ The work of Maryna Viazovska ⋮ From sphere packing to Fourier interpolation ⋮ The magic of 8 and 24 ⋮ Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound ⋮ The sextuply shortened binary Golay code is optimal ⋮ On the minimum average distance of binary constant weight codes ⋮ Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays ⋮ Delsarte method in the problem on kissing numbers in high-dimensional spaces ⋮ On the construction of \(q\)-ary equidistant codes ⋮ On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions ⋮ Finite projective planes and the Delsarte LP-bound ⋮ Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) ⋮ Kravchuk polynomials and induced/reduced operators on Clifford algebras ⋮ What is known about unit cubes ⋮ On the variance of average distance of subsets in the Hamming space ⋮ Optimality and uniqueness of the Leech lattice among lattices ⋮ On the minimum average distance of binary codes: Linear programming approach ⋮ Unrestricted codes with the Golay parameters are unique ⋮ Turán's extremal problem on locally compact abelian groups ⋮ Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\) ⋮ Local spectra of perfect binary codes ⋮ Alternating bilinear forms over GF(q) ⋮ A linear programming problem in harmonic analysis ⋮ A generalized Gleason-Pierce-Ward theorem ⋮ Bounds for codes by semidefinite programming ⋮ The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space ⋮ Bounds for discrepancies in the Hamming space ⋮ Bilinear forms over a finite field, with applications to coding theory ⋮ Sphere packing and quantum gravity ⋮ Kravchuk matrices and induced operators on Clifford algebras ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Almost impossible \(E_8\) and Leech lattices ⋮ Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications ⋮ Exploiting special structure in semidefinite programming: a survey of theory and applications ⋮ The Cartan-Hadamard conjecture and the little prince ⋮ ASYMPTOTIC LINEAR PROGRAMMING LOWER BOUNDS FOR THE ENERGY OF MINIMIZING RIESZ AND GAUSS CONFIGURATIONS ⋮ A minimal design of order 11 on the 3-sphere ⋮ An application of positive definite functions to the problem of MUBs ⋮ Dual bounds for the positive definite functions approach to mutually unbiased bases ⋮ On the nonbinary Johnson scheme
This page was built for publication:
