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