New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
From MaRDI portal
Publication:855871
DOI10.1016/j.jcta.2006.03.010zbMath1105.94027OpenAlexW2075804573WikidataQ114851636 ScholiaQ114851636MaRDI QIDQ855871
Hajime Tanaka, Dion C. Gijswijt, 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
Terwilliger algebraupper boundssemidefinite programmingblock-diagonalizationcodesnonbinary codesdelsarte bound
Semidefinite programming (90C22) Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65)
Related Items
On the non-existence of extended 1-perfect codes and MDS codes, Design theory from the viewpoint of algebraic combinatorics, Semidefinite bounds for nonbinary codes based on quadruples, The Terwilliger algebra of the halved folded \(2n\)-cube from the viewpoint of its automorphism group action, Tight relative t-designs on two shells in hypercubes, and Hahn and Hermite polynomials, New Bounds for Equiangular Lines and Spherical Two-Distance Sets, New inequalities for \(q\)-ary constant-weight codes, The Clebsch-Gordan rule for \(U(\mathfrak{sl}_2)\), the Krawtchouk algebras and the Hamming graphs, Semidefinite programming bounds for binary codes from a split Terwilliger algebra, A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4, Terwilliger algebras of wreath products of association schemes, Symmetric sums of squares over \(k\)-subset hypercubes, The triple distribution of codes and ordered codes, High dimensional Hoffman bound and applications in extremal combinatorics, Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme, Wreath product action on generalized Boolean algebras, Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling, On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra, Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs, An Assmus-Mattson theorem for codes over commutative association schemes, Semidefinite bounds for mixed binary/ternary codes, Symmetry in semidefinite programs, The quantum adjacency algebra and subconstituent algebra of a graph, New upper bounds for kissing numbers from semidefinite programming, Pseudo-direct sums and wreath products of loose-coherent algebras with applications to coherent configurations, Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming, Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces, TD-pairs and the $q$-Onsager algebra, Invariant Semidefinite Programs, Bounds for codes by semidefinite programming, New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra, New code upper bounds for the folded \(n\)-cube, A diagram associated with the subconstituent algebra of a distance-regular graph, Semidefinite programming bounds for Lee codes, The Terwilliger algebra of the halved \(n\)-cube from the viewpoint of its automorphism group action, A survey on spherical designs and algebraic combinatorics on spheres, Commutative association schemes, New lower bounds on \(q\)-ary error-correcting codes, Exploiting special structure in semidefinite programming: a survey of theory and applications, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory
Cites Work
