New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
DOI10.1016/J.JCTA.2006.03.010zbMATH Open1105.94027OpenAlexW2075804573WikidataQ114851636 ScholiaQ114851636MaRDI QIDQ855871FDOQ855871
Dion Gijswijt, Hajime Tanaka, Alexander Schrijver
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/13374
semidefinite programmingTerwilliger algebracodesupper boundsblock-diagonalizationnonbinary codesdelsarte bound
Semidefinite programming (90C22) Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65)
Cites Work
- Title not available (Why is that?)
- The subconstituent algebra of an association scheme. I
- Title not available (Why is that?)
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
- Bounds on mixed binary/ternary codes
- Error-correcting codes over an alphabet of four elements
- Bounds on codes over an alphabet of five elements
Cited In (42)
- New inequalities for \(q\)-ary constant-weight codes
- The Clebsch-Gordan rule for \(U(\mathfrak{sl}_2)\), the Krawtchouk algebras and the Hamming graphs
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- A new upper bound on nonbinary block codes
- Semidefinite bounds for mixed binary/ternary codes
- New lower bounds on \(q\)-ary error-correcting codes
- Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials
- On the non-existence of extended 1-perfect codes and MDS codes
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra
- The quantum adjacency algebra and subconstituent algebra of a graph
- Design theory from the viewpoint of algebraic combinatorics
- Bounds for codes by semidefinite programming
- Symmetric sums of squares over \(k\)-subset hypercubes
- New upper bounds for kissing numbers from semidefinite programming
- Pseudo-direct sums and wreath products of loose-coherent algebras with applications to coherent configurations
- Semidefinite programming bounds for Lee codes
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- A survey on spherical designs and algebraic combinatorics on spheres
- New Bounds for Equiangular Lines and Spherical Two-Distance Sets
- The Terwilliger algebras of odd graphs and doubled odd graphs
- Semidefinite bounds for nonbinary codes based on quadruples
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Symmetry in semidefinite programs
- High dimensional Hoffman bound and applications in extremal combinatorics
- Wreath product action on generalized Boolean algebras
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
- The triple distribution of codes and ordered codes
- The Terwilliger algebra of the halved \(n\)-cube from the viewpoint of its automorphism group action
- Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory
- The Terwilliger algebra of the halved folded \(2n\)-cube from the viewpoint of its automorphism group action
- New code upper bounds for the folded \(n\)-cube
- On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra
- Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs
- Commutative association schemes
- An Assmus-Mattson theorem for codes over commutative association schemes
- TD-pairs and the $q$-Onsager algebra
- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- A diagram associated with the subconstituent algebra of a distance-regular graph
- Invariant Semidefinite Programs
- Terwilliger algebras of wreath products of association schemes
Recommendations
- New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming π π
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra π π
- Title not available (Why is that?) π π
- A new upper bound on nonbinary block codes π π
- Semidefinite bounds for mixed binary/ternary codes π π
- Bounds for codes by semidefinite programming π π
- Semidefinite bounds for nonbinary codes based on quadruples π π
- New and updated semidefinite programming bounds for subspace codes π π
- Strengthened semidefinite programming bounds for codes π π
- Improved Semidefinite Programming Bound on Sizes of Codes π π
This page was built for publication: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855871)