Strengthened semidefinite programming bounds for codes
This article studies the problem of computing the maximum size of a binary code of a word of length \(n\) and minimum distance of at least \(m\). The author presents a hierarchy of semidefinite upper bounds for the maximum size and existing known bounds are positioned in the various levels of this hierarchy. In the first section the relevant background and necessary definitions and notation are outlined. This is followed in the second section with a series of theorems on invariant matrices and the \(*\)-representation of a matrix. Results relating to the block-diagonalization of the Terwilliger algebra are also included. The third section presents the main contribution of this paper where the hierarchy of upper bounds is defined and improvements to current bounds are derived. Several theorems and lemmas are presented with proof, as well as computational results highlighting the improved bounds. The article concludes with a list of relevant references.
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Bounds for codes by semidefinite programming
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Semidefinite bounds for nonbinary codes based on quadruples
- Semidefinite bounds for mixed binary/ternary codes
- A comparison of the Delsarte and Lovász bounds
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A note on the stability number of an orthogonality graph
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Geometric algorithms and combinatorial optimization
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3680516 (Why is no real title available?)
- scientific article; zbMATH DE number 3634289 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- On the Shannon capacity of a graph
- Reduction of symmetric semidefinite programs using the regular -representation
- Symmetry groups, semidefinite programs, and sums of squares
- The subconstituent algebra of an association scheme. I
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- Commutative association schemes
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Symmetric sums of squares over \(k\)-subset hypercubes
- Semidefinite bounds for mixed binary/ternary codes
- Bounds for projective codes from semidefinite programming
- New and updated semidefinite programming bounds for subspace codes
- New code upper bounds for the folded \(n\)-cube
- Semidefinite programming bounds for Lee codes
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- Semidefinite bounds for nonbinary codes based on quadruples
- Invariant Semidefinite Programs
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- New upper bounds on codes via association schemes and linear programming
- New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
- Symmetries in polynomial optimization
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Bounds for codes by semidefinite programming
- Copositive programming motivated bounds on the stability and the chromatic numbers
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Reduction of symmetric semidefinite programs using the regular -representation
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Symmetry in semidefinite programs
This page was built for publication: Strengthened semidefinite programming bounds for codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868466)
