{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T17:04:44Z","timestamp":1780679084339,"version":"3.54.1"},"reference-count":40,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.jcta.2026.106212","type":"journal-article","created":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T12:37:54Z","timestamp":1776947874000},"page":"106212","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Optimal quantum (r,\u03b4)-locally repairable codes via classical ones"],"prefix":"10.1016","volume":"223","author":[{"given":"Kun","family":"Zhou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3437-054X","authenticated-orcid":false,"given":"Meng","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"7","key":"10.1016\/j.jcta.2026.106212_br0010","doi-asserted-by":"crossref","first-page":"3065","DOI":"10.1109\/18.959288","article-title":"Nonbinary quantum stabilizer codes","volume":"47","author":"Ashikhmin","year":"2001","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.jcta.2026.106212_br0020","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/18.681315","article-title":"Quantum error correction via codes over GF(4)","volume":"44","author":"Calderbank","year":"1998","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"10.1016\/j.jcta.2026.106212_br0030","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","article-title":"Good quantum error-correcting codes exist","volume":"54","author":"Calderbank","year":"1996","journal-title":"Phys. Rev. A"},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0040","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/TIT.2021.3120016","article-title":"A construction of maximally recoverable codes with order-optimal field size","volume":"68","author":"Cai","year":"2022","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0050","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TCOMM.2018.2869800","article-title":"Optimal locally repairable systematic codes based on packings","volume":"67","author":"Cai","year":"2019","journal-title":"IEEE Trans. Commun."},{"issue":"8","key":"10.1016\/j.jcta.2026.106212_br0060","doi-asserted-by":"crossref","first-page":"4853","DOI":"10.1109\/TIT.2020.2977647","article-title":"On optimal locally repairable codes with super-linear length","volume":"66","author":"Cai","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"10.1016\/j.jcta.2026.106212_br0070","doi-asserted-by":"crossref","first-page":"2240","DOI":"10.1109\/TIT.2022.3225953","article-title":"A bound on the minimal field size of LRCs, and cyclic MR codes that attain it","volume":"69","author":"Cai","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"10.1016\/j.jcta.2026.106212_br0080","doi-asserted-by":"crossref","first-page":"5623","DOI":"10.1109\/TCOMM.2023.3292293","article-title":"Optimal and asymptotically good locally repairable codes via propagation rules","volume":"71","author":"Chen","year":"2023","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0090","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/TIT.2020.3036279","article-title":"Improved bounds and Singleton-optimal constructions of locally repairable codes with minimum distance 5 and 6","volume":"67","author":"Chen","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10.1016\/j.jcta.2026.106212_br0100","doi-asserted-by":"crossref","first-page":"5253","DOI":"10.1109\/TCOMM.2019.2916085","article-title":"Constructions of optimal (r,\u03b4) locally repairable codes via constacyclic codes","volume":"67","author":"Chen","year":"2019","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"10.1016\/j.jcta.2026.106212_br0110","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1109\/TIT.2015.2512864","article-title":"Constructions and properties of linear locally repairable codes","volume":"62","author":"Ernvall","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2026.106212_br0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.ffa.2025.102785","article-title":"Quantum (r,\u03b4)-locally recoverable codes","volume":"111","author":"Galindo","year":"2026","journal-title":"Finite Fields Appl."},{"key":"10.1016\/j.jcta.2026.106212_br0130","series-title":"Stabilizer Codes and Quantum Error Correction","author":"Gottesman","year":"1997"},{"issue":"11","key":"10.1016\/j.jcta.2026.106212_br0140","doi-asserted-by":"crossref","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","article-title":"On the locality of codeword symbols","volume":"58","author":"Gopalan","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0150","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1142\/S0219749904000079","article-title":"On optimal quantum codes","volume":"2","author":"Grassl","year":"2004","journal-title":"Int. J. Quantum Inf."},{"key":"10.1016\/j.jcta.2026.106212_br0160","series-title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","first-page":"5512","article-title":"Quantum locally recoverable codes","author":"Golowic","year":"2025"},{"issue":"6","key":"10.1016\/j.jcta.2026.106212_br0170","doi-asserted-by":"crossref","first-page":"3662","DOI":"10.1109\/TIT.2019.2891765","article-title":"How long can optimal locally repairable codes be?","volume":"65","author":"Guruswami","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"10.1016\/j.jcta.2026.106212_br0180","doi-asserted-by":"crossref","first-page":"2895","DOI":"10.1109\/TCOMM.2022.3155165","article-title":"Constructions and weight distributions of optimal locally repairable codes","volume":"70","author":"Hao","year":"2022","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0190","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2435204.2435207","article-title":"Pyramid codes: flexible schemes to trade space for access efficiency in reliable data storage systems","volume":"9","author":"Huang","year":"2013","journal-title":"ACM Trans. Storage (TOS)"},{"issue":"8","key":"10.1016\/j.jcta.2026.106212_br0200","doi-asserted-by":"crossref","first-page":"4637","DOI":"10.1109\/TIT.2014.2329872","article-title":"Codes with local regeneration and erasure correction","volume":"60","author":"Kamath","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10.1016\/j.jcta.2026.106212_br0210","doi-asserted-by":"crossref","first-page":"4892","DOI":"10.1109\/TIT.2006.883612","article-title":"Nonbinary stabilizer codes over finite fields","volume":"52","author":"Ketkar","year":"2006","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2026.106212_br0220","author":"Kolosov"},{"issue":"2","key":"10.1016\/j.jcta.2026.106212_br0230","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1103\/PhysRevA.55.900","article-title":"Theory of quantum error-correcting codes","volume":"55","author":"Knill","year":"1997","journal-title":"Phys. Rev. A"},{"issue":"10","key":"10.1016\/j.jcta.2026.106212_br0240","doi-asserted-by":"crossref","first-page":"6491","DOI":"10.1109\/TIT.2021.3103330","article-title":"New constructions of optimal locally repairable codes with super-linear length","volume":"67","author":"Kong","year":"2021","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0250","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.2022.3203591","article-title":"Three new constructions of optimal locally repairable codes from matrix-product codes","volume":"69","author":"Luo","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.jcta.2026.106212_br0260","doi-asserted-by":"crossref","first-page":"1794","DOI":"10.1109\/TIT.2025.3533494","article-title":"Bounds and constructions of quantum locally recoverable codes from quantum CSS codes","volume":"71","author":"Luo","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0270","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TCOMM.2023.3307142","article-title":"On lengths of Singleton-optimal locally repairable codes","volume":"72","author":"Liu","year":"2024","journal-title":"IEEE Trans. Commun."},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0280","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1109\/TIT.2019.2939464","article-title":"Constructions of locally recoverable codes which are optimal","volume":"66","author":"Micheli","year":"2020","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2026.106212_br0290","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/j.jcta.2026.106212_br0300","series-title":"2012 IEEE International Symposium on Information Theory Proceedings","first-page":"2776","article-title":"Optimal linear codes with a local-error-correction property","author":"Prakash","year":"2012"},{"issue":"10","key":"10.1016\/j.jcta.2026.106212_br0310","doi-asserted-by":"crossref","first-page":"5843","DOI":"10.1109\/TIT.2014.2325570","article-title":"Locally repairable codes","volume":"60","author":"Papailiopoulos","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.jcta.2026.106212_br0320","doi-asserted-by":"crossref","first-page":"1827","DOI":"10.1109\/18.782103","article-title":"Nonbinary quantum codes","volume":"45","author":"Rains","year":"1999","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"10.1016\/j.jcta.2026.106212_br0330","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","article-title":"Optimal locally repairable and secure codes for distributed storage systems","volume":"60","author":"Rawat","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"10.1016\/j.jcta.2026.106212_br0340","doi-asserted-by":"crossref","first-page":"8542","DOI":"10.1109\/TCOMM.2025.3565507","article-title":"Block circulant codes with application to decentralized systems","volume":"73","author":"Sasidharan","year":"2025","journal-title":"IEEE Trans. Commun."},{"key":"10.1016\/j.jcta.2026.106212_br0350","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/JSAIT.2025.3567480","article-title":"Quantum locally recoverable codes via good polynomials","volume":"6","author":"Sharma","year":"2025","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"issue":"5","key":"10.1016\/j.jcta.2026.106212_br0360","doi-asserted-by":"crossref","first-page":"1019","DOI":"10.1109\/JSAC.2014.140521","article-title":"Optimal locally repairable linear codes","volume":"32","author":"Song","year":"2014","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"12","key":"10.1016\/j.jcta.2026.106212_br0370","doi-asserted-by":"crossref","first-page":"6661","DOI":"10.1109\/TIT.2016.2555813","article-title":"Optimal locally repairable codes and connections to matroid theory","volume":"62","author":"Tamo","year":"2016","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"10.1016\/j.jcta.2026.106212_br0380","doi-asserted-by":"crossref","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","article-title":"A family of optimal locally recoverable codes","volume":"60","author":"Tamo","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.jcta.2026.106212_br0390","doi-asserted-by":"crossref","first-page":"4741","DOI":"10.1103\/PhysRevA.54.4741","article-title":"Simple quantum error-correcting codes","volume":"54","author":"Steane","year":"1996","journal-title":"Phys. Rev. A"},{"key":"10.1016\/j.jcta.2026.106212_br0400","author":"Zhu"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316526000555?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316526000555?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:47:06Z","timestamp":1780678026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316526000555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":40,"alternative-id":["S0097316526000555"],"URL":"https:\/\/doi.org\/10.1016\/j.jcta.2026.106212","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimal quantum (r,\u03b4)-locally repairable codes via classical ones","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcta.2026.106212","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"106212"}}