Improved Upper Bound On A(188)

Polak Sven. Arxiv 2016

[Paper]    
ARXIV

For nonnegative integers $n$ and $d$, let $A(n,d)$ be the maximum cardinality of a binary code of length $n$ and minimum distance at least $d$. We consider a slight sharpening of the semidefinite programming bound of Gijswijt, Mittelmann and Schrijver, and obtain that $A(18,8)\le 70$.

Similar Work

• Uniqueness Of Codes Using Semidefinite Programming
• Bounds For Binary Codes Relative To Pseudo-distances Of K Points
• New Upper Bounds On A(nd)
• On The Vc-dimension Of Binary Codes