{
  "id": "math/0610856",
  "version": "v2",
  "published": "2006-10-27T15:57:24.000Z",
  "updated": "2007-10-18T09:44:53.000Z",
  "title": "Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps",
  "authors": [
    "Christine Bachoc",
    "Frank Vallentin"
  ],
  "comment": "15 pages, (v2) referee comments and suggestions incorporated",
  "journal": "Europ. J. Comb. 30 (2009), 625-637.",
  "doi": "10.1016/j.ejc.2008.07.017",
  "categories": [
    "math.MG",
    "math.CO"
  ],
  "abstract": "We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in particular get a new tight bound in dimension 8. Furthermore we show how to use the SDP framework to get analytic bounds.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2007-10-18T09:44:53.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "52C17",
      "90C22"
    ],
    "keywords": [
      "multivariate orthogonal polynomials",
      "spherical caps",
      "upper bounds",
      "analytic bounds",
      "semidefinite programming approach"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math.....10856B"
    }
  }
}