New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming
Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
A note on the stability number of an orthogonality graph
European Journal of Combinatorics
Algorithm 875: DSDP5—software for semidefinite programming
ACM Transactions on Mathematical Software (TOMS)
Leonard triples and hypercubes
Journal of Algebraic Combinatorics: An International Journal
New proofs of the Assmus-Mattson theorem based on the Terwilliger algebra
European Journal of Combinatorics
A survey on spherical designs and algebraic combinatorics on spheres
European Journal of Combinatorics
Commutative association schemes
European Journal of Combinatorics
Problems from CGCS Luminy, May 2007
European Journal of Combinatorics
Classification of binary constant weight codes
IEEE Transactions on Information Theory
A GAP package for computation with coherent configurations
ICMS'10 Proceedings of the Third international congress conference on Mathematical software
Symmetric chains, Gelfand---Tsetlin chains, and the Terwilliger algebra of the binary Hamming scheme
Journal of Algebraic Combinatorics: An International Journal
Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Using symmetry to optimize over the sherali-adams relaxation
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
Mathematics of Operations Research
Hi-index | 754.90 |
We give a new upper bound on the maximum size A(n,d) of a binary code of word length n and minimum distance at least d. It is based on block-diagonalizing the Terwilliger algebra of the Hamming cube. The bound strengthens the Delsarte bound, and can be calculated with semidefinite programming in time bounded by a polynomial in n. We show that it improves a number of known upper bounds for concrete values of n and d. From this we also derive a new upper bound on the maximum size A(n,d,w) of a binary code of word length n, minimum distance at least d, and constant weight w, again strengthening the Delsarte bound and yielding several improved upper bounds for concrete values of n, d, and w