{
  "id": "1403.7933",
  "version": "v1",
  "published": "2014-03-31T09:58:57.000Z",
  "updated": "2014-03-31T09:58:57.000Z",
  "title": "Additive codes over $GF(4)$ from circulant graphs",
  "authors": [
    "Ruihu Li",
    "Xueliang Li",
    "Yaping Mao",
    "Meiqin Wei"
  ],
  "comment": "9 pages. arXiv admin note: substantial text overlap with arXiv:1402.6399",
  "categories": [
    "math.CO",
    "cs.DM",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "In $2006$, Danielsen and Parker \\cite{DP} proved that every self-dual additive code over $GF(4)$ is equivalent to a graph code. So, graph is an important tool for searching (proposed) optimum codes. In this paper, we introduce a new method of searching (proposed) optimum additive codes from circulant graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-03-31T09:58:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "94B05",
      "05C50",
      "05C25"
    ],
    "keywords": [
      "circulant graphs",
      "important tool",
      "self-dual additive code",
      "optimum codes"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 9,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1403.7933L"
    }
  }
}