{
  "id": "2406.15926",
  "version": "v1",
  "published": "2024-06-22T19:32:50.000Z",
  "updated": "2024-06-22T19:32:50.000Z",
  "title": "A linear programming bound for sum-rank metric codes",
  "authors": [
    "Aida Abiad",
    "Alexander L. Gavrilyuk",
    "Antonina P. Khramova",
    "Ilia Ponomarenko"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all previously known bounds.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2024-06-22T19:32:50.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "linear programming bound",
      "sum-rank metric codes",
      "bounds outperform",
      "maximum cardinality",
      "relatively small instances"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}