New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
From MaRDI portal
Publication:3547598
DOI10.1109/TIT.2005.851748zbMath1298.94152OpenAlexW2104385491WikidataQ114847626 ScholiaQ114847626MaRDI QIDQ3547598
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.851748
upper boundssemidefinite programmingblock-diagonalizationDelsarte boundconstant-weight codesTerwilliger algebra, codes
Semidefinite programming (90C22) Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Bounds on codes (94B65) Associative rings and algebras arising under various constructions (16S99)
Related Items
\(Q\)-polynomial coherent configurations, Design theory from the viewpoint of algebraic combinatorics, Semidefinite bounds for nonbinary codes based on quadruples, Algebras, graphs and thetas, Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems, New Bounds for Spherical Two-Distance Sets, Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem, \(k\)-point semidefinite programming bounds for equiangular lines, New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming, A note on the stability number of an orthogonality graph, 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, Semidefinite programming relaxations for graph coloring and maximal clique problems, Strengthened semidefinite programming bounds for codes, Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation, Three-point bounds for energy minimization, On optimal binary codes with unbalanced coordinates, Semidefinite bounds for the stability number of a graph via sums of squares of polynomials, On semidefinite programming relaxations of maximum \(k\)-section, New Bounds for Equiangular Lines and Spherical Two-Distance Sets, 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, The Goldman-Rota identity and the Grassmann scheme, Entanglement of free fermions on Johnson graphs, On Integrality in Semidefinite Programming for Discrete Optimization, A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4, A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES, Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry, Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting), Symmetric sums of squares over \(k\)-subset hypercubes, Group symmetry and covariance regularization, The triple distribution of codes and ordered codes, High dimensional Hoffman bound and applications in extremal combinatorics, New and updated semidefinite programming bounds for subspace codes, Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme, The absolute bound for coherent configurations, The sextuply shortened binary Golay code is optimal, Tightness in subset bounds for coherent configurations, The joint weight enumerator of an LCD code and its dual, Using symmetry to optimize over the Sherali-Adams relaxation, 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, Combinatorial extensions of Terwilliger algebras and wreath products of association schemes, A cross-intersection theorem for vector spaces based on semidefinite programming, Symmetry in semidefinite programs, Varietal Terwilliger algebras arising from wreath products of rank two association schemes, Optimal binary constant weight codes and affine linear groups over finite fields, Uniqueness of codes using semidefinite programming, The quantum adjacency algebra and subconstituent algebra of a graph, New upper bounds for kissing numbers from semidefinite programming, Problems from CGCS Luminy, May 2007, 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, Towards a proof of the 24-cell conjecture, TD-pairs and the $q$-Onsager algebra, Relaxations of Combinatorial Problems Via Association Schemes, Invariant Semidefinite Programs, Bounds for codes by semidefinite programming, Improved linear programming bound on sizes of doubly constant-weight codes, Invitation to intersection problems for finite sets, 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, Moment methods in energy minimization: New bounds for Riesz minimal energy problems, Leonard triples and hypercubes, On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming, Fundamentals of coding type problems, Bounds on subsets of coherent configurations, 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, Exploiting group symmetry in truss topology optimization, Exploiting special structure in semidefinite programming: a survey of theory and applications, Two new four-error-correcting binary codes, Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory, Exploiting symmetry in copositive programs via semidefinite hierarchies, The density of sets avoiding distance 1 in Euclidean space, A general method to obtain the spectrum and local spectra of a graph from its regular partitions
