Strengthened semidefinite programming bounds for codes
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- A comparison of the Delsarte and Lovász bounds
- 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
- 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 \(\ast\)-representation
- Symmetry groups, semidefinite programs, and sums of squares
- The subconstituent algebra of an association scheme. I
Cited in
(27)- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- Invariant Semidefinite Programs
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- New upper bounds on codes via association schemes and linear programming
- Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
- Semidefinite bounds for nonbinary codes based on quadruples
- Semidefinite programming bounds for Lee codes
- New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
- Bounds for projective codes from semidefinite programming
- Symmetric sums of squares over \(k\)-subset hypercubes
- Semidefinite bounds for mixed binary/ternary codes
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Symmetry in semidefinite programs
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Commutative association schemes
- Bounds for codes by semidefinite programming
- New code upper bounds for the folded \(n\)-cube
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- Block-diagonal semidefinite programming hierarchies for 0/1 programming
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- New and updated semidefinite programming bounds for subspace codes
- Exploiting symmetry in copositive programs via semidefinite hierarchies
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)
