Semidefinite programming bounds for binary codes from a split Terwilliger algebra
arXiv:2203.06568 · doi:10.1007/s10623-023-01250-4
Abstract
We study the upper bounds for , the maximum size of codewords with length and Hamming distance at least . Schrijver studied the Terwilliger algebra of the Hamming scheme and proposed a semidefinite program to bound . We derive more sophisticated matrix inequalities based on a split Terwilliger algebra to improve Schrijver's semidefinite programming bounds on . In particular, we improve the semidefinite programming bounds on to .
arXiv comment15 pages
References in corpus (6)
- New upper bounds for kissing numbers from semidefinite programming
- Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators
- Semidefinite bounds for nonbinary codes based on quadruples
- Bounds on sets with few distances
- On the MacWilliams Identity for Classical and Quantum Convolutional Codes
- Semidefinite programming bounds for constant weight codes