{
  "id": "1402.6399",
  "version": "v3",
  "published": "2014-02-26T02:38:40.000Z",
  "updated": "2014-03-31T10:03:41.000Z",
  "title": "Formally self-dual linear binary codes from circulant graphs",
  "authors": [
    "Ruihu Li",
    "Xueliang Li",
    "Yaping Mao",
    "Meiqin Wei"
  ],
  "comment": "15 pages",
  "categories": [
    "math.CO",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "In 2002, Tonchev first constructed some linear binary codes defined by the adjacency matrices of undirected graphs. So, graph is an important tool for searching optimum codes. In this paper, we introduce a new method of searching (proposed) optimum formally self-dual linear binary codes from circulant graphs.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2014-03-31T10:03:41.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "94B05",
      "05C50",
      "05C25"
    ],
    "keywords": [
      "formally self-dual linear binary codes",
      "circulant graphs",
      "optimum formally self-dual linear binary",
      "important tool"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 15,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1402.6399L"
    }
  }
}