Improved upper bound on A(18,8)
classification
🧮 math.CO
math.OC
keywords
boundbinarycardinalitycodeconsiderdistancegijswijtimproved
read the original abstract
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)\leq 70$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.