scientific article; zbMATH DE number 3543912
From MaRDI portal
Publication:4119093
zbMATH Open0348.94016MaRDI QIDQ4119093FDOQ4119093
Authors: Philippe Delsarte 
Publication date: 1972
Title of this publication is not available (Why is that?)
Recommendations
Cited In (79)
- On distance distributions of orthogonal arrays
- Dual bounds for the positive definite functions approach to mutually unbiased bases
- Sphere packing and quantum gravity
- A linear programming problem in harmonic analysis
- One more proof of the first linear programming bound for binary codes and two conjectures
- The sextuply shortened binary Golay code is optimal
- Sphere packing bounds via spherical codes
- Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)
- Kravchuk matrices and induced operators on Clifford algebras
- Three-point bounds for energy minimization
- A minimal design of order 11 on the 3-sphere
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- Linear programming bounds for unitary codes
- Spectral approach to linear programming bounds on codes
- Improved Delsarte bounds for spherical codes in small dimensions
- Optimality and uniqueness of the Leech lattice among lattices
- A Bound for the Maximum Weight of a Linear Code
- Finite projective planes and the Delsarte LP-bound
- Parity check systems of nonlinear codes over finite commutative Frobenius rings
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- What is known about unit cubes
- An application of positive definite functions to the problem of MUBs
- Bilinear forms over a finite field, with applications to coding theory
- Title not available (Why is that?)
- Bounds for codes by semidefinite programming
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- Algebraic theory of block codes detecting independent errors
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound
- Energy bounds for codes in polynomial metric spaces
- Delsarte’s extremal problem and packing on locally compact Abelian groups
- Asymptotic linear programming lower bounds for the energy of minimizing Riesz and Gauss configurations
- On the variance of average distance of subsets in the Hamming space
- Alternating bilinear forms over GF(q)
- High-dimensional sphere packing and the modular bootstrap
- Kravchuk polynomials and induced/reduced operators on Clifford algebras
- A note on the stability number of an orthogonality graph
- Bounds for discrepancies in the Hamming space
- A direct approach to linear programming bounds for codes and tms-nets
- On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions
- Upper bounds for A(n,4) and A(n,6) derived from Delsarte's linear programming bound
- Properties of dual codes defined by nondegenerate forms
- A generalized Gleason-Pierce-Ward theorem
- Linear programming bounds
- Local spectra of perfect binary codes
- Numerical results on the asymptotic rate of binary codes
- Delsarte method in the problem on kissing numbers in high-dimensional spaces
- Linear programming bounds for codes in infinite projective spaces
- Symmetry in mathematical programming
- Dual codes of systematic group codes over abelian groups
- Almost impossible \(E_8\) and Leech lattices
- On the construction of \(q\)-ary equidistant codes
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- On the minimum average distance of binary codes: Linear programming approach
- On linear codes which attain the Solomon-Stiffler bound
- On non-full-rank perfect codes over finite fields
- On the minimum average distance of binary constant weight codes
- Turán's extremal problem on locally compact abelian groups
- Unrestricted codes with the Golay parameters are unique
- The Cartan-Hadamard conjecture and the little prince
- Upper bounds for the cardinality of s-distances codes
- On kissing numbers and spherical codes in high dimensions
- Recent Bounds in Coding Using Programming Techniques
- On the nonbinary Johnson scheme
- From sphere packing to Fourier interpolation
- Title not available (Why is that?)
- New upper bounds for spherical codes and packings
- The subfield metric and its application to quantum error correction
- Unique optima of the Delsarte linear program
- Estimates of the maximal value of angular code distance for 24 and 25 points on the unit sphere in \(\mathbb{R}^4\)
- Application of Orthogonal Polynomials and Special Matrices to Orthogonal Arrays
- The Klein quartic maximizes the multiplicity of the first positive eigenvalue of the Laplacian
- The magic of 8 and 24
- Linear programming-based optimization of the distance spectrum of linear block codes
- Title not available (Why is that?)
- The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
- Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs
- Dual linear programming bounds for sphere packing via discrete reductions
- The work of Maryna Viazovska
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 Q4119093)
