@article{c089b589fc5f4777a88664519e856cb9,
title = "Semidefinite programming bounds for binary codes from a split Terwilliger algebra",
abstract = "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 scheme and proposed a semidefinite program to bound A(n, d). We derive more sophisticated matrix inequalities based on a split Terwilliger algebra to improve Schrijver{\textquoteright}s semidefinite programming bounds on A(n, d). In particular, we improve the semidefinite programming bounds on A(18, 4) to 6551.",
keywords = "Binary codes, Distance distribution, Semidefinite program, Terwilliger algebra, Weight enumeration",
author = "Tseng, {Pin Chieh} and Lai, {Ching Yi} and Yu, {Wei Hsuan}",
note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",
year = "2023",
month = oct,
doi = "10.1007/s10623-023-01250-4",
language = "???core.languages.en_GB???",
volume = "91",
pages = "3241--3262",
journal = "Designs, Codes, and Cryptography",
issn = "0925-1022",
number = "10",
}