{
  "id": "1012.4134",
  "version": "v3",
  "published": "2010-12-19T00:27:50.000Z",
  "updated": "2011-08-03T10:39:03.000Z",
  "title": "On triply even binary codes",
  "authors": [
    "Koichi Betsumiya",
    "Akihiro Munemasa"
  ],
  "comment": "21 pages + appendix of 10 pages. Minor revision",
  "journal": "J. London Math. Soc. (2) 86 (2012) 1-16",
  "doi": "10.1112/jlms/jdr054",
  "categories": [
    "math.CO"
  ],
  "abstract": "A triply even code is a binary linear code in which the weight of every codeword is divisible by 8. We show how two doubly even codes of lengths m_1 and m_2 can be combined to make a triply even code of length m_1+m_2, and then prove that every maximal triply even code of length 48 can be obtained by combining two doubly even codes of length 24 in a certain way. Using this result, we show that there are exactly 10 maximal triply even codes of length 48 up to equivalence.",
  "revisions": [
    {
      "version": "v3",
      "updated": "2011-08-03T10:39:03.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05E20",
      "05E30",
      "94B05"
    ],
    "keywords": [
      "binary codes",
      "binary linear code",
      "equivalence"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 21,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1012.4134B"
    }
  }
}