Semidefinite Code Bounds Based on Quadruple Distances

DOI10.1109/TIT.2012.2184845zbMath1365.94623arXiv1005.4959OpenAlexW2123109473MaRDI QIDQ5271940

Dion C. Gijswijt, Hans D. Mittelmann, Alexander Schrijver

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1005.4959

Mathematics Subject Classification ID

Semidefinite programming (90C22) Bounds on codes (94B65) Other types of codes (94B60) Algebraic systems of matrices (15A30)

Related Items

Semidefinite bounds for nonbinary codes based on quadruples, Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems, \(k\)-point semidefinite programming bounds for equiangular lines, Three-point bounds for energy minimization, On optimal binary codes with unbalanced coordinates, Constructing error-correcting binary codes using transitive permutation groups, New inequalities for \(q\)-ary constant-weight codes, One more proof of the first linear programming bound for binary codes and two conjectures, Semidefinite programming bounds for binary codes from a split Terwilliger algebra, A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES, The sextuply shortened binary Golay code is optimal, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, Semidefinite bounds for mixed binary/ternary codes, Corrected mean-field model for random sequential adsorption on random geometric graphs, Uniqueness of codes using semidefinite programming, Invariant Semidefinite Programs, The State-of-the-Art in Conic Optimization Software, Improved linear programming bound on sizes of doubly constant-weight codes, Semidefinite programming bounds for Lee codes, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory