{
  "id": "1903.01832",
  "version": "v1",
  "published": "2019-03-05T14:10:56.000Z",
  "updated": "2019-03-05T14:10:56.000Z",
  "title": "Self-orthogonal codes from equitable partitions of association schemes",
  "authors": [
    "Dean Crnkovic",
    "Sanja Rukavina",
    "Andrea Svob"
  ],
  "comment": "14 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "We give a method of constructing self-orthogonal codes from equitable partitions of association schemes. By applying this method we construct self-orthogonal codes from some distance-regular graphs. Some of the obtained codes are optimal. Further, we introduce a notion of self-orthogonal subspace codes. We show that under some conditions equitable partitions of association schemes yield such self-orthogonal subspace codes and we give some examples from distance-regular graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-03-05T14:10:56.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05E30",
      "05E18",
      "94B05",
      "94B60"
    ],
    "keywords": [
      "self-orthogonal subspace codes",
      "distance-regular graphs",
      "construct self-orthogonal codes",
      "association schemes yield",
      "constructing self-orthogonal codes"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}