{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T16:31:52Z","timestamp":1778603512563,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T00:00:00Z","timestamp":1672099200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T00:00:00Z","timestamp":1672099200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10623-022-01165-6","type":"journal-article","created":{"date-parts":[[2022,12,27]],"date-time":"2022-12-27T12:02:50Z","timestamp":1672142570000},"page":"1495-1526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Optimal quaternary $$(r,\\delta )$$-locally recoverable codes: their structures and complete classification"],"prefix":"10.1007","volume":"91","author":[{"given":"Li","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhengchun","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4008-2031","authenticated-orcid":false,"given":"Sihem","family":"Mesnager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,27]]},"reference":[{"key":"1165_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316257449","volume-title":"Finite Geometry and Combinatorial Applications","author":"S Ball","year":"2015","unstructured":"Ball S.: Finite Geometry and Combinatorial Applications. Cambridge University Press, Cambridge (2015)."},{"issue":"4","key":"1165_CR2","doi-asserted-by":"publisher","first-page":"2402","DOI":"10.1109\/TIT.2019.2944397","volume":"66","author":"H Cai","year":"2019","unstructured":"Cai H., Miao Y., Schwartz M., Tang X.: On optimal locally repairable codes with multiple disjoint repair sets. IEEE Trans. Inform. Theory 66(4), 2402\u20132416 (2019).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1165_CR3","doi-asserted-by":"publisher","first-page":"2499","DOI":"10.1109\/TIT.2017.2761120","volume":"64","author":"B Chen","year":"2018","unstructured":"Chen B., Xia S., Hao J., Fu F.: Constructions of optimal cyclic $$(r, \\delta )$$ locally repairable codes. IEEE Trans. Inform. Theory 64(4), 2499\u20132511 (2018).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1165_CR4","doi-asserted-by":"crossref","unstructured":"Ernvall T., Westerb$$\\ddot{a}$$ck T., Freij R., Hollanti C.: Constructions and properties of linear locally repairable codes. IEEE Trans. Inform. Theory 62(3), 1129\u20131143 (2016).","DOI":"10.1109\/TIT.2015.2512864"},{"issue":"11","key":"1165_CR5","doi-asserted-by":"publisher","first-page":"6925","DOI":"10.1109\/TIT.2012.2208937","volume":"58","author":"P Gopalan","year":"2012","unstructured":"Gopalan P., Huang C., Simitci H., Yekhanin S.: On the locality of codeword symbols. IEEE Trans. Inform. Theory 58(11), 6925\u20136934 (2012).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1165_CR6","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de (2007)."},{"issue":"6","key":"1165_CR7","doi-asserted-by":"publisher","first-page":"3662","DOI":"10.1109\/TIT.2019.2891765","volume":"65","author":"V Guruswami","year":"2019","unstructured":"Guruswami V., Xing C., Yuan C.: How long can optimal locally repairable codes be? IEEE Trans. Inform. Theory 65(6), 3662\u20133670 (2019).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1165_CR8","doi-asserted-by":"crossref","unstructured":"Hao J., Shum K., Xia S., Fu F., Yang Y.: On optimal quaternary locally repairable codes. In: 2021 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 3267\u20133272 (2021).","DOI":"10.1109\/ISIT45174.2021.9518245"},{"key":"1165_CR9","doi-asserted-by":"crossref","unstructured":"Hao J., Shum K., Xia S., Yang Y.: Classification of optimal ternary $$(r, \\delta )$$-locally repairable codes attaining the singleton-like bound. In: 2019 IEEE International Symposium on Information Theory Proceedings (ISIT) (2019).","DOI":"10.1109\/ISIT.2019.8849762"},{"key":"1165_CR10","doi-asserted-by":"crossref","unstructured":"Hao J., Xia S., Chen B.: On optimal ternary locally repairable codes. In: 2017 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 171\u2013175 (2017)","DOI":"10.1109\/ISIT.2017.8006512"},{"issue":"12","key":"1165_CR11","doi-asserted-by":"publisher","first-page":"7465","DOI":"10.1109\/TIT.2020.3021707","volume":"66","author":"J Hao","year":"2020","unstructured":"Hao J., Xia S., Shum K., Chen B., Fu F., Yang Y.: Bounds and constructions of locally repairable codes: parity-check matrix approach. IEEE Trans. Inform. Theory 66(12), 7465\u20137474 (2020).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1165_CR12","doi-asserted-by":"crossref","unstructured":"Hao J., Xia S., Chen B.: On the linear codes with $$(r, \\delta )$$-locality for distributed storage. In: IEEE International Conference on Communications, pp. 1\u20136 (2017).","DOI":"10.1109\/ICC.2017.7997028"},{"key":"1165_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"W Huffman","year":"2003","unstructured":"Huffman W., Pless V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)."},{"issue":"8","key":"1165_CR14","doi-asserted-by":"publisher","first-page":"4658","DOI":"10.1109\/TIT.2019.2901492","volume":"65","author":"L Jin","year":"2019","unstructured":"Jin L.: Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes. IEEE Trans. Inform. Theory 65(8), 4658\u20134663 (2019).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"1165_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TIT.2019.2946627","volume":"66","author":"L Jin","year":"2019","unstructured":"Jin L., Kan H., Zhang Y.: Constructions of locally repairable codes with multiple recovering sets via rational function fields. IEEE Trans. Inform. Theory 66(1), 202\u2013209 (2019).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"8","key":"1165_CR16","doi-asserted-by":"publisher","first-page":"4637","DOI":"10.1109\/TIT.2014.2329872","volume":"60","author":"G Kamath","year":"2014","unstructured":"Kamath G., Prakash N., Lalitha V., Kumar P.: Codes with local regeneration and erasure correction. IEEE Trans. Inform. Theory 60(8), 4637\u20134660 (2014).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1165_CR17","volume-title":"The Theory of Error-Correcting Codes","author":"F MacWilliams","year":"1977","unstructured":"MacWilliams F., Sloane A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)."},{"issue":"10","key":"1165_CR18","doi-asserted-by":"publisher","first-page":"5843","DOI":"10.1109\/TIT.2014.2325570","volume":"60","author":"D Papailiopoulos","year":"2014","unstructured":"Papailiopoulos D., Dimakis A.: Locally repairable codes. IEEE Trans. Inform. Theory 60(10), 5843\u20135855 (2014).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1165_CR19","doi-asserted-by":"crossref","unstructured":"Prakash N., Kamath G., Lalitha V., Kumar P.: Optimal linear codes with a local-error-correction property. In: 2012 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 2776\u20132780 (2012).","DOI":"10.1109\/ISIT.2012.6284028"},{"issue":"1","key":"1165_CR20","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","volume":"60","author":"A Rawat","year":"2014","unstructured":"Rawat A., Koyluoglu O., Silberstein N., Vishwanath S.: Optimal locally repairable and secure codes for distributed storage systems. IEEE Trans. Inform. Theory 60(1), 212\u2013236 (2014).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"1165_CR21","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1109\/JSAC.2014.140521","volume":"32","author":"W Song","year":"2014","unstructured":"Song W., Dau S., Yuen C., Li T.: Optimal locally repairable linear codes. IEEE J. Select. Areas Commun. 32(5), 1019\u20131036 (2014).","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"8","key":"1165_CR22","doi-asserted-by":"publisher","first-page":"4661","DOI":"10.1109\/TIT.2014.2321280","volume":"60","author":"I Tamo","year":"2014","unstructured":"Tamo I., Barg A.: A family of optimal locally recoverable codes. IEEE Trans. Inform. Theory 60(8), 4661\u20134676 (2014).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"1165_CR23","first-page":"345","volume":"3","author":"I Tamo","year":"2016","unstructured":"Tamo I., Barg A., Goparaju S., Calderbank R.: Cyclic LRC codes, binary LRC codes, and upper bounds on the distance of cyclic codes. Int. J. Inf. Cod. Theory 3(4), 345\u2013364 (2016).","journal-title":"Int. J. Inf. Cod. Theory"},{"issue":"12","key":"1165_CR24","doi-asserted-by":"publisher","first-page":"6661","DOI":"10.1109\/TIT.2016.2555813","volume":"62","author":"I Tamo","year":"2016","unstructured":"Tamo I., Papailiopoulos D., Dimakis A.: Optimal locally repairable codes and connections to matroid theory. IEEE Trans. Inform. Theory 62(12), 6661\u20136671 (2016).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1165_CR25","doi-asserted-by":"crossref","unstructured":"Wang A., Zhang Z., Liu M.: Achieving arbitrary locality and availability in binary codes. In: 2015 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1866\u20131870 (2015).","DOI":"10.1109\/ISIT.2015.7282779"},{"issue":"7","key":"1165_CR26","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1109\/LCOMM.2021.3075520","volume":"25","author":"J Wang","year":"2021","unstructured":"Wang J., Shen K., Liu X., Yu C.: Construction of binary locally repairable codes with optimal distance and code rate. IEEE Commun. Lett. 25(7), 2109\u20132113 (2021).","journal-title":"IEEE Commun. Lett."},{"key":"1165_CR27","unstructured":"Xing C., Yuan C.: Construction of optimal locally recoverable codes and connection with hypergraph. arXiv:1811.09142 (2018)."},{"issue":"2","key":"1165_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-019-2649-5","volume":"63","author":"Y Zhang","year":"2020","unstructured":"Zhang Y., Kan H.: Locally repairable codes from combinatorial designs. Sci. China Inf. Sci. 63(2), 1\u201315 (2020).","journal-title":"Sci. China Inf. Sci."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01165-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01165-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01165-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T07:04:56Z","timestamp":1680678296000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01165-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,27]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1165"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01165-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,27]]},"assertion":[{"value":"23 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 December 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}