{
  "id": "1605.09333",
  "version": "v1",
  "published": "2016-05-30T17:19:15.000Z",
  "updated": "2016-05-30T17:19:15.000Z",
  "title": "Minimum distance of Line Orthogonal Grassmann Codes in even characteristic",
  "authors": [
    "Ilaria Cardinali",
    "Luca Giuzzi"
  ],
  "comment": "14 pages",
  "categories": [
    "math.CO",
    "cs.IT",
    "math.IT"
  ],
  "abstract": "In this paper we determine the minimum distance of orthogonal line-Grassmann codes for $q$ even. The case $q$ odd was solved in \"I. Cardinali, L. Giuzzi, K. Kaipa, A. Pasini, Line Polar Grassmann Codes of Orthogonal Type, J. Pure Applied Algebra.\" We also show that for $q$ even all minimum weight codewords are equivalent and that symplectic line-Grassmann codes are proper subcodes of codimension $2n$ of the orthogonal ones.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-05-30T17:19:15.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "51A50",
      "51E22",
      "51A45"
    ],
    "keywords": [
      "line orthogonal grassmann codes",
      "minimum distance",
      "characteristic",
      "line polar grassmann codes",
      "orthogonal line-grassmann codes"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 14,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}