{
  "annotation_id": "80a99b37-8f19-42c8-9597-110d024bbf30",
  "date_created": "2026-03-02T18:02:34.590000Z",
  "date_modified": "2026-03-02T18:02:34.590000Z",
  "file_hash": "40a1ee8efb745d9d460b3d7b52351cdab5d3a505c1313e16dcb9485da78d80f7",
  "private": false,
  "record": {
    "abstract": "In this paper, a construction of a pair of \"regular\" quasi-cyclic LDPC codes\nas ingredient codes for a quantum error-correcting code is proposed. That is,\nwe find quantum regular LDPC codes with various weight distributions.\nFurthermore our proposed codes have lots of variations for length, code rate.\nThese codes are obtained by a descrete mathematical characterization for model\nmatrices of quasi-cyclic LDPC codes.\n  Our proposed codes achieve a bounded distance decoding (BDD) bound, or known\nas VG bound, and achieve a lower bound of the code length.",
    "arxiv_id": "quant-ph/0701020",
    "authors": [
      "Manabu Hagiwara",
      "Hideki Imai"
    ],
    "categories": [
      "quant-ph",
      "cs.IT",
      "math-ph",
      "math.CO",
      "math.IT",
      "math.MP"
    ],
    "doi": "10.1109/ISIT.2007.4557323",
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Quantum Quasi-Cyclic LDPC Codes",
    "url": "https://arxiv.org/abs/quant-ph/0701020"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "1985a9fc-ccd1-4092-9180-8a456323a05f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}