{
  "annotation_id": "65badcf1-ac6e-4524-af59-2584c790ec5d",
  "date_created": "2026-03-02T18:02:13.039000Z",
  "date_modified": "2026-03-02T18:02:13.039000Z",
  "file_hash": "7b8a0dba9ce4432e4ea9e717ff5d2cdb661d9c2b3f2a17a9deeefd9fdfc4eb49",
  "private": false,
  "record": {
    "abstract": "Simple rate-1/3 single-error-correcting unrestricted and CSS-type quantum\nconvolutional codes are constructed from classical self-orthogonal\n$\\F_4$-linear and $\\F_2$-linear convolutional codes, respectively. These\nquantum convolutional codes have higher rate than comparable quantum block\ncodes or previous quantum convolutional codes, and are simple to decode. A\nblock single-error-correcting [9, 3, 3] tail-biting code is derived from the\nunrestricted convolutional code, and similarly a [15, 5, 3] CSS-type block code\nfrom the CSS-type convolutional code.",
    "arxiv_id": "quant-ph/0501099",
    "authors": [
      "G. David Forney, Jr.",
      "Saikat Guha"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math.IT"
    ],
    "doi": "10.1109/ISIT.2005.1523495",
    "title": "Simple Rate-1/3 Convolutional and Tail-Biting Quantum Error-Correcting   Codes",
    "url": "https://arxiv.org/abs/quant-ph/0501099"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "1417f74f-d8e9-4c72-87d8-f6a506b13e26",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}