Pages that link to "Item:Q5271940"

The following pages link to Semidefinite Code Bounds Based on Quadruple Distances (Q5271940):

Displaying 20 items.

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