Semidefinite programming bounds for binary codes from a split Terwilliger algebra

Pin-Chieh Tseng, Ching-Yi Lai, Wei-Hsuan Yu

We study the upper bounds for $A(n,d)$, the maximum size of codewords with length $n$ and Hamming distance at least $d$. Schrijver studied the Terwilliger algebra of the Hamming sc…