Journal
DESIGNS CODES AND CRYPTOGRAPHY
Volume -, Issue -, Pages -Publisher
SPRINGER
DOI: 10.1007/s10623-023-01250-4
Keywords
Semidefinite program; Binary codes; Terwilliger algebra; Weight enumeration; Distance distribution
Ask authors/readers for more resources
In this study, we propose more sophisticated matrix inequalities based on a split Terwilliger algebra to improve Schrijver's semidefinite programming bounds on A(n, d). In particular, we improve the semidefinite programming bounds on A(18, 4) to 6551.
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's semidefinite programming bounds on A(n, d). In particular, we improve the semidefinite programming bounds on A(18, 4) to 6551.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
