Pages that link to "Item:Q2364626"
From MaRDI portal
The following pages link to Semidefinite bounds for nonbinary codes based on quadruples (Q2364626):
Displaying 19 items.
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming (Q855871) (← links)
- Strengthened semidefinite programming bounds for codes (Q868466) (← links)
- Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) (← links)
- New nonbinary code bounds based on divisibility arguments (Q1741925) (← links)
- Semidefinite bounds for mixed binary/ternary codes (Q1744761) (← links)
- Uniqueness of codes using semidefinite programming (Q1999906) (← links)
- Dual bounds for the positive definite functions approach to mutually unbiased bases (Q2098296) (← links)
- \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
- New and updated semidefinite programming bounds for subspace codes (Q2210639) (← links)
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces (Q2278701) (← links)
- New code upper bounds for the folded \(n\)-cube (Q2299631) (← links)
- Semidefinite programming bounds for Lee codes (Q2312798) (← links)
- New lower bounds on \(q\)-ary error-correcting codes (Q2325290) (← links)
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting) (Q2693046) (← links)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming (Q3547598) (← links)
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling (Q5152478) (← links)
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory (Q5864695) (← links)
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra (Q6074024) (← links)
- New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming (Q6608048) (← links)
