{
  "annotation_id": "ac2f5cbd-cbfb-4085-91bc-1900bfcf46c0",
  "date_created": "2026-03-02T18:02:30.340000Z",
  "date_modified": "2026-03-02T18:02:30.340000Z",
  "file_hash": "d3e741a5cf72ae70fcce5ac94de2a833edeb8f64307b98ce16f75eee66cce517",
  "private": false,
  "record": {
    "abstract": "In this paper we present several classes of asymptotically good concatenated\nquantum codes and derive lower bounds on the minimum distance and rate of the\ncodes. We compare these bounds with the best-known bound of\nAshikhmin--Litsyn--Tsfasman and Matsumoto. We also give a polynomial-time\ndecoding algorithm for the codes that can decode up to one fourth of the lower\nbound on the minimum distance of the codes.",
    "arxiv_id": "quant-ph/0608063",
    "authors": [
      "Hachiro Fujita"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Several Classes of Concatenated Quantum Codes: Constructions and Bounds",
    "url": "https://arxiv.org/abs/quant-ph/0608063"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "09f67b8c-5c31-4662-926d-e96ca77c519d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}