{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T16:02:21Z","timestamp":1771257741203,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T00:00:00Z","timestamp":1748649600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP24K14831"],"award-info":[{"award-number":["JP24K14831"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008702","name":"Kagoshima University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008702","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>It is known that entanglement-assisted quantum error-correcting codes (EAQECCs), a type of quantum error correction codes, can be easily constructed using linear codes that satisfy the property called linear complementary duals (LCD). For quasi-cyclic (QC) codes, which are a class of linear codes, we have already published the methods for constructing the codes with properties such as self-orthogonality, self-duality and reversibility according to the prime-factor decomposition of <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$-1+x^m$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:msup>\n                      <mml:mi>x<\/mml:mi>\n                      <mml:mi>m<\/mml:mi>\n                    <\/mml:msup>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>, which reduce the amount of calculation by assembling several small generator polynomial matrices into a large generator polynomial matrix. In this paper, we propose a method to construct LCD\u2013QC codes according to the prime-factor decomposition. The main idea of this method is to decompose the generator polynomial matrix of the QC code into several small generator polynomial matrices corresponding to the prime factors and perform LCD determination, which leads to a reduction in the amount of calculation. As an application of our construction method, we create EAQECCs from the constructed LCD\u2013QC codes, compare those minimum weights with the maximum values of the minimum weights of existing EAQECCs and find 15 EAQECCs with larger minimum weights than the existing ones.<\/jats:p>","DOI":"10.1007\/s10623-025-01650-8","type":"journal-article","created":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T06:15:43Z","timestamp":1748672143000},"page":"3575-3591","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Entanglement-assisted quantum error-correcting codes via quasi-cyclic codes with complementary duals"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4778-8045","authenticated-orcid":false,"given":"Hajime","family":"Matsui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kakeru","family":"Kaneko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,31]]},"reference":[{"issue":"5798","key":"1650_CR1","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1126\/science.1131563","volume":"314","author":"T Brun","year":"2006","unstructured":"Brun T., Devetak I., Hsieh M.H.: Correcting quantum errors with entanglement. Science 314(5798), 436\u2013439 (2006).","journal-title":"Science"},{"key":"1650_CR2","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"AR Calderbank","year":"1996","unstructured":"Calderbank A.R., Shor P.W.: Good quantum error-correcting codes exist. Phys. Rev. A 54, 1098\u20131105 (1996).","journal-title":"Phys. Rev. A"},{"key":"1650_CR3","unstructured":"Grassl M.: Code Tables: bounds on the parameters of various types of codes, last updated on 27 May (2024). http:\/\/codetables.de\/."},{"key":"1650_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ffa.2016.07.005","volume":"42","author":"C G\u00fcneri","year":"2016","unstructured":"G\u00fcneri C., \u00d6zkaya B., Sol\u00e9 P.: Quasi-cyclic complementary dual codes. Finite Fields Their Appl. 42, 67\u201380 (2016).","journal-title":"Finite Fields Their Appl."},{"key":"1650_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.ffa.2017.06.005","volume":"47","author":"C G\u00fcneri","year":"2017","unstructured":"G\u00fcneri C., \u00d6zbudak F., \u00d6zkaya B., Sa\u00e7\u0131kara E., Sepasdar Z., Sol\u00e9 P.: Structure and performance of generalized quasi-cyclic codes. Finite Fields Their Appl. 47, 183\u2013202 (2017).","journal-title":"Finite Fields Their Appl."},{"issue":"5","key":"1650_CR6","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1109\/TIT.1974.1055262","volume":"20","author":"T Kasami","year":"1974","unstructured":"Kasami T.: A Gilbert\u2013Varshamov bound for quasi-cycle codes of rate 1\/2. IEEE Trans. Inf. Theory 20(5), 679 (1974).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1\u20132","key":"1650_CR7","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0166-218X(00)00350-4","volume":"111","author":"K Lally","year":"2001","unstructured":"Lally K., Fitzpatrick P.: Algebraic structure of quasicyclic codes. Discret. Appl. Math. 111(1\u20132), 157\u2013175 (2001).","journal-title":"Discret. Appl. Math."},{"issue":"7","key":"1650_CR8","doi-asserted-by":"publisher","first-page":"2751","DOI":"10.1109\/18.959257","volume":"47","author":"S Ling","year":"2001","unstructured":"Ling S., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes, I. Finite fields. IEEE Trans. Inf. Theory 47(7), 2751\u20132760 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1650_CR9","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ffa.2018.09.001","volume":"55","author":"X Liu","year":"2019","unstructured":"Liu X., Yu L., Hu P.: New entanglement-assisted quantum codes from $$k$$-Galois dual codes. Finite Fields Their Appl. 55, 21\u201332 (2019).","journal-title":"Finite Fields Their Appl."},{"key":"1650_CR10","unstructured":"Luo G., Ezerman M.F., Grassl M., Ling S.: How much entanglement does a quantum code need? (2022). arXiv:2207.05647v2."},{"key":"1650_CR11","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0012-365X(92)90563-U","volume":"106\u2013107","author":"JL Massey","year":"1992","unstructured":"Massey J.L.: Linear codes with complementary duals. Discret. Math. 106\u2013107, 337\u2013342 (1992).","journal-title":"Discret. Math."},{"key":"1650_CR12","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.ffa.2015.02.003","volume":"34","author":"H Matsui","year":"2015","unstructured":"Matsui H.: On generator and parity-check polynomial matrices of generalized quasi-cyclic codes. Finite Fields Their Appl. 34, 280\u2013304 (2015).","journal-title":"Finite Fields Their Appl."},{"issue":"4","key":"1650_CR13","doi-asserted-by":"publisher","first-page":"82","DOI":"10.3390\/math5040082","volume":"5","author":"H Matsui","year":"2017","unstructured":"Matsui H.: Multiplicative structure and Hecke rings of generator matrices for codes over quotient rings of Euclidean domains. MDPI Math. 5(4), 82 (2017). https:\/\/doi.org\/10.3390\/math5040082.","journal-title":"MDPI Math."},{"issue":"11","key":"1650_CR14","doi-asserted-by":"publisher","first-page":"1649","DOI":"10.1587\/transfun.2021EAL2021","volume":"E104\u2013A","author":"H Matsui","year":"2021","unstructured":"Matsui H.: A modulus factorization algorithm for self-orthogonal and self-dual quasi-cyclic codes via polynomial matrices. IEICE Trans. Fundam. E104\u2013A(11), 1649\u20131653 (2021).","journal-title":"IEICE Trans. Fundam."},{"key":"1650_CR15","doi-asserted-by":"crossref","unstructured":"Moenck R.T.: Fast computation of GCDs. In: STOC \u201973: Proceedings of the Fifth Annual ACM Symposium on Theory of Computing, April 1973, pp. 142\u2013151 (1973).","DOI":"10.1145\/800125.804045"},{"key":"1650_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102204","volume":"89","author":"N Ojiro","year":"2023","unstructured":"Ojiro N., Kaneko K., Matsui H.: An efficient algorithm for constructing reversible quasi-cyclic codes via Chinese remainder theorem. Finite Fields Their Appl. 89, 102204 (2023).","journal-title":"Finite Fields Their Appl."},{"key":"1650_CR17","doi-asserted-by":"crossref","unstructured":"Ojiro N., Matsui H.: On generator polynomial matrices of quasi-cyclic codes with linear complementary duals. Accepted by Journal of Algebra Combinatorics Discrete Structures and Applications on March 7, (2025).","DOI":"10.13069\/jacodesmath.v12i3.324"},{"key":"1650_CR18","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10623-014-9997-6","volume":"77","author":"J Qian","year":"2015","unstructured":"Qian J., Zhang L.: Entanglement-assisted quantum codes from arbitrary binary linear codes. Des. Codes Cryptogr. 77, 193\u2013202 (2015).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1650_CR19","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1103\/RevModPhys.87.307","volume":"87","author":"BM Terhal","year":"2015","unstructured":"Terhal B.M.: Quantum error correction for quantum memories. Rev. Mod. Phys. 87(2), 307\u2013346 (2015).","journal-title":"Rev. Mod. Phys."},{"key":"1650_CR20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.77.064302","volume":"77","author":"MM Wilde","year":"2008","unstructured":"Wilde M.M., Brun T.A.: Optimal entanglement formulas for entanglement-assisted quantum coding. Phys. Rev. A 77, 064302 (2008).","journal-title":"Phys. Rev. A"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01650-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01650-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01650-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:30:46Z","timestamp":1757957446000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01650-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,31]]},"references-count":20,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1650"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01650-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,31]]},"assertion":[{"value":"15 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}