{
  "annotation_id": "380917e7-0e10-4a9f-bb8a-1511754d1905",
  "date_created": "2026-03-02T18:01:38.771000Z",
  "date_modified": "2026-03-02T18:01:38.771000Z",
  "file_hash": "2fe22c7b4160f9aa5abe42d71a5f1cbac1e9c8e9ff961f04832c0de58a7e0935",
  "private": false,
  "record": {
    "abstract": "A conceptually simple method for derivation of lower bounds on the error\nexponent of specific families of block codes used on classical-quantum channels\nwith arbitrary signal states over a finite Hilbert space is presented. It is\nshown that families of binary block codes with appropriately rescaled binomial\nmultiplicity enumerators used on binary classical-quantum channels and decoded\nby the suboptimal decision rule introduced by Holevo attain the expurgated and\ncutoff rate lower bounds on the error exponent.",
    "arxiv_id": "quant-ph/0007051",
    "authors": [
      "Pawel Wocjan",
      "Dejan E. Lazic",
      "Thomas Beth"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Performances of Block Codes Attaining the Expurgated and Cutoff Rate   Lower Bounds on the Error Exponent of Binary Classical-Quantum Channels",
    "url": "https://arxiv.org/abs/quant-ph/0007051"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "022ed576-10d3-4369-ae0f-f7b2eebbccd4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}