New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming
From MaRDI portal
Recommendations
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Strengthened semidefinite programming bounds for codes
- Semidefinite bounds for nonbinary codes based on quadruples
- New code upper bounds for the folded \(n\)-cube
- Bounds for codes by semidefinite programming
Cited in
(only showing first 100 items - show all)- New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
- Leonard triples and hypercubes
- Bounds on subsets of coherent configurations
- 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
- Symmetric sums of squares over \(k\)-subset hypercubes
- The sextuply shortened binary Golay code is optimal
- The joint weight enumerator of an LCD code and its dual
- An Assmus-Mattson theorem for codes over commutative association schemes
- Semidefinite bounds for mixed binary/ternary codes
- Varietal Terwilliger algebras arising from wreath products of rank two association schemes
- Improved linear programming bound on sizes of doubly constant-weight codes
- On semidefinite programming relaxations of maximum \(k\)-section
- Group symmetry and covariance regularization
- 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
- Pseudo-direct sums and wreath products of loose-coherent algebras with applications to coherent configurations
- The Terwilliger algebra of the halved \(n\)-cube from the viewpoint of its automorphism group action
- Q-polynomial coherent configurations
- Algebras, graphs and thetas
- \(k\)-point semidefinite programming bounds for equiangular lines
- The Terwilliger algebra of the halved folded 2n-cube from the viewpoint of its automorphism group action
- New and updated semidefinite programming bounds for subspace codes
- Refinements of Levenshtein bounds in \(q\)-ary Hamming spaces
- New code upper bounds for the folded \(n\)-cube
- Semidefinite programming bounds for Lee codes
- Exploiting symmetry in copositive programs via semidefinite hierarchies
- The density of sets avoiding distance 1 in Euclidean space
- Design theory from the viewpoint of algebraic combinatorics
- Semidefinite bounds for nonbinary codes based on quadruples
- The absolute bound for coherent configurations
- Semidefinite programming for permutation codes
- Tightness in subset bounds for coherent configurations
- Two new four-error-correcting binary codes
- A note on the stability number of an orthogonality graph
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- High dimensional Hoffman bound and applications in extremal combinatorics
- Relaxations of combinatorial problems via association schemes
- Invariant Semidefinite Programs
- On the Turing model complexity of interior point methods for semidefinite programming
- Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
- A general method to obtain the spectrum and local spectra of a graph from its regular partitions
- New upper bounds for kissing numbers from semidefinite programming
- Fundamentals of coding type problems
- On optimal binary codes with unbalanced coordinates
- scientific article; zbMATH DE number 3952664 (Why is no real title available?)
- New inequalities for q-ary constant-weight codes
- The Goldman-Rota identity and the Grassmann scheme
- Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
- Using symmetry to optimize over the Sherali-Adams relaxation
- Wreath product action on generalized Boolean algebras
- A simple proof of the improved Johnson bound for binary codes
- On Lee association schemes over \(\mathbb{Z}_4\) and their Terwilliger algebra
- Nonsymmetric Askey-Wilson polynomials and \(Q\)-polynomial distance-regular graphs
- Tight relative \(t\)-designs on two shells in hypercubes, and Hahn and Hermite polynomials
- Combinatorial extensions of Terwilliger algebras and wreath products of association schemes
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- TD-pairs and the q-Onsager algebra
- A diagram associated with the subconstituent algebra of a distance-regular graph
- Moment methods in energy minimization: new bounds for Riesz minimal energy problems
- New Bounds for Spherical Two-Distance Sets
- Three-point bounds for energy minimization
- New bounds for equiangular lines and spherical two-distance sets
- A cross-intersection theorem for vector spaces based on semidefinite programming
- Symmetry reduction to optimize a graph-based polynomial from queueing theory
- 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
- Entanglement of free fermions on Johnson graphs
- On Integrality in Semidefinite Programming for Discrete Optimization
- New upper bounds on codes via association schemes and linear programming
- The triple distribution of codes and ordered codes
- Symmetric chains, Gelfand--Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
- New lower bounds on crossing numbers of \(K_{m,n}\) from semidefinite programming
- On the size of maximal binary codes with 2, 3, and 4 distances
- Subspace coverings with multiplicities
- The Terwilliger algebras of odd graphs and doubled odd graphs
- Semidefinite programming bounds for spherical three-distance sets
- On the classification of triply transitive strongly regular graphs
- Spectral Pseudorandomness and the Road to Improved Clique Number Bounds for Paley Graphs
- The Terwilliger algebras of bipartite Q-polynomial distance-regular graphs
- On the Terwilliger algebra of the group association scheme of the symmetric group \(\mathrm{Sym}(7)\)
- The Terwilliger algebras of the group association schemes of two non-abelian groups
- An imperceptible connection between the Clebsch-Gordan coefficients of \(U_q(\mathfrak{sl}_2)\) and the Terwilliger algebras of Grassmann graphs
- The isomorphism problem of trees from the viewpoint of Terwilliger algebras with respect to an edge
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Towards a proof of the 24-cell conjecture
- The Terwilliger algebras of the group association schemes of non-abelian finite groups admitting an abelian subgroup of index 2
- Bounds for codes by semidefinite programming
- Invitation to intersection problems for finite sets
- Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
- New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Strengthened semidefinite programming bounds for codes
- Reduction of symmetric semidefinite programs using the regular -representation
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
- A new relative bound for equiangular lines and nonexistence of tight spherical designs of harmonic index 4
- Symmetry in semidefinite programs
This page was built for publication: New Code Upper Bounds From 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 Q3547598)
