{
  "id": "1612.02178",
  "version": "v1",
  "published": "2016-12-07T10:10:20.000Z",
  "updated": "2016-12-07T10:10:20.000Z",
  "title": "Improved upper bound on A(18,8)",
  "authors": [
    "Sven Polak"
  ],
  "comment": "3 pages",
  "categories": [
    "math.CO",
    "math.OC"
  ],
  "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$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-12-07T10:10:20.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "94B65",
      "90C22"
    ],
    "keywords": [
      "upper bound",
      "maximum cardinality",
      "binary code",
      "minimum distance",
      "semidefinite programming bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}