{
  "id": "2204.08552",
  "version": "v1",
  "published": "2022-04-18T20:43:10.000Z",
  "updated": "2022-04-18T20:43:10.000Z",
  "title": "LCD subspace codes",
  "authors": [
    "Dean Crnkovic",
    "Andrea Svob"
  ],
  "comment": "12 pages. arXiv admin note: substantial text overlap with arXiv:1903.01832",
  "categories": [
    "math.CO"
  ],
  "abstract": "A subspace code is a nonempty set of subspaces of vectors space $\\mathbb F^n_q$. Linear codes with complementary duals, or LCD codes, are linear codes whose intersection with their duals are trivial. In this paper, we introduce a notion of LCD subspace codes. We show that the nearest-codeword (or maximum-likelihood) decoding problem for an LCD subspace code reduces to a problem that is simpler than for a general subspace code. Further, we show that under some conditions equitable partitions of association schemes yield such LCD subspace codes and as an illustration of the method give some examples from distance-regular graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2022-04-18T20:43:10.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05E30",
      "05E18",
      "94B05",
      "94B60"
    ],
    "keywords": [
      "linear codes",
      "lcd subspace code reduces",
      "association schemes yield",
      "general subspace code",
      "nonempty set"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}