{
  "id": "1111.0356",
  "version": "v2",
  "published": "2011-11-02T01:16:12.000Z",
  "updated": "2013-10-18T16:37:16.000Z",
  "title": "Toric complete intersection codes",
  "authors": [
    "Ivan Soprunov"
  ],
  "comment": "14 pages, 2 figures. Minor changes, simpler proofs, new examples",
  "journal": "Journal of Symbolic Computation, Volume 50, (2013), Pages 374-385",
  "categories": [
    "math.AG",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "In this paper we give lower bounds for the minimum distance of evaluation codes constructed from complete intersections in toric varieties. This generalizes the results of Gold-Little-Schenck and Ballico-Fontanari who considered evaluation codes on complete intersections in the projective space.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2013-10-18T16:37:16.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "14M25",
      "14G50",
      "52B20",
      "94B27"
    ],
    "keywords": [
      "toric complete intersection codes",
      "lower bounds",
      "minimum distance",
      "toric varieties",
      "evaluation codes"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1111.0356S"
    }
  }
}