@inproceedings{eb2e4dab15bf469d92bf500745da7130,
title = "Improved semidefinite programming bounds for binary codes by split distance enumerations",
abstract = "We study the maximum size of a binary code A(n, d) with code length n and minimum distance d. Schrijver studied the Terwilliger algebra of the Hamming scheme and proposed a semidefinite program to upper bound A(n, d). We derive additional semidefinite constraints based on a split Terwilliger algebra so that Schrijver's semidefinite programming bounds on A(n, d) can be improved. In particular, we show that A(18, 4) ≤ 6551 and A(19, 4) 13087.",
keywords = "Terwilliger algebra, binary codes, semidefinite p≤rogram",
author = "Tseng, {Pin Chieh} and Lai, {Ching Yi} and Yu, {Wei Hsuan}",
note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 2022 IEEE International Symposium on Information Theory, ISIT 2022 ; Conference date: 26-06-2022 Through 01-07-2022",
year = "2022",
doi = "10.1109/ISIT50566.2022.9834515",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "3073--3078",
booktitle = "2022 IEEE International Symposium on Information Theory, ISIT 2022",
address = "United States",
}