Improved upper bound on A(18,8)

arXiv1612.02178MaRDI QIDQ6280554FDOQ6280554

Authors: Sven C. Polak 

Publication date: 7 December 2016

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)leq70$.

Mathematics Subject Classification ID

Semidefinite programming (90C22) Bounds on codes (94B65)

This page was built for publication: Improved upper bound on A(18,8)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6280554)