{
  "annotation_id": "19ca4752-eaed-4989-a5e3-68677e85e708",
  "date_created": "2026-02-17T05:53:15.706000Z",
  "date_modified": "2026-02-17T05:53:15.706000Z",
  "file_hash": "dc096f882b99997d09fd56af3972f028da4cd39ca4dc5266d5d480d90d3c0ace",
  "private": false,
  "record": {
    "abstract": "The punctured dodecacode is an additive $4$-ary code of length $11$ and distance $5$ which is uniformly packed. We show that a code with the same weight distribution is equivalent to it. This code is also shown to be nonlinear.\n  We also establish the nonexistence of analogues of the dodecacode and the punctured dodecacode in Doob graphs. To that end, we classify two-weight codes of weights $6$ and $8$ in Doob and $4$-ary Hamming graphs of diameter $9$ and the corresponding strongly regular graphs.\n  Keywords: dodecacode, additive code, trace Hermitian duality, uniformly packed code, completely regular code, Doob graph, strongly regular graph",
    "arxiv_id": "2601.08008",
    "authors": [
      "Markus Grassl",
      "Denis Krotov",
      "Lin Sok",
      "Patrick Sol\u00e9"
    ],
    "categories": [
      "math.CO"
    ],
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "The punctured dodecacode is unique",
    "url": "https://arxiv.org/abs/2601.08008",
    "version": "v1"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c9e2c88d-ab99-41f1-aa47-7b2fc91b089c",
    "id": "arXiv Dataset",
    "type": "Model",
    "variant": "snapshot-2026-01-17",
    "version": "0.1.0"
  },
  "user_id": 1000002
}