{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T04:01:20Z","timestamp":1746763280832,"version":"3.40.5"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T00:00:00Z","timestamp":1734652800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100024173","name":"Simons Laufer Mathematical Sciences Institute, University of California Berkeley","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100024173","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100003582","name":"American Institute of Mathematics","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100003582","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10623-024-01532-5","type":"journal-article","created":{"date-parts":[[2024,12,20]],"date-time":"2024-12-20T13:46:30Z","timestamp":1734702390000},"page":"1255-1270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A construction of optimal quasi-cyclic locally recoverable codes using constituent codes"],"prefix":"10.1007","volume":"93","author":[{"given":"Gustavo","family":"Terra\u00a0Bastos","sequence":"first","affiliation":[]},{"given":"Angelynn","family":"\u00c1lvarez","sequence":"additional","affiliation":[]},{"given":"Zachary","family":"Flores","sequence":"additional","affiliation":[]},{"given":"Adriana","family":"Salerno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,20]]},"reference":[{"issue":"8","key":"1532_CR1","doi-asserted-by":"publisher","first-page":"4928","DOI":"10.1109\/TIT.2017.2700859","volume":"63","author":"A Barg","year":"2017","unstructured":"Barg A., Tamo I., Vl\u0103du\u0163 S.: Locally recoverable codes on algebraic curves. IEEE Trans. Inf. Theory 63(8), 4928\u20134939 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1532_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01270398","volume":"4","author":"J Conan","year":"1993","unstructured":"Conan J., S\u00e9guin G.: Structural properties and enumeration of quasicyclic codes. Appl. Algebra Eng. Commun. Comput. 4, 25\u201339 (1993).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1532_CR3","doi-asserted-by":"crossref","unstructured":"Goparaju S., Calderbank R.: Binary cyclic codes that are locally repairable. In: 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, pp. 676\u2013680 (2014).","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"1532_CR4","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes. http:\/\/www.codetables.de. Accessed 26 Sept 2023."},{"issue":"4","key":"1532_CR5","doi-asserted-by":"publisher","first-page":"1781","DOI":"10.1137\/120865823","volume":"26","author":"C G\u00fcneri","year":"2012","unstructured":"G\u00fcneri C., \u00d6zbudak F.: A bound on the minimum distance of quasi-cyclic codes. SIAM J. Discret. Math. 26(4), 1781\u20131796 (2012).","journal-title":"SIAM J. Discret. Math."},{"key":"1532_CR6","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.ffa.2011.07.004","volume":"18","author":"C G\u00fcneri","year":"2012","unstructured":"G\u00fcneri C., \u00d6zbudak F.: A relation between quasi-cyclic codes and 2-D cyclic codes. Finite Fields Appl. 18, 123\u2013132 (2012).","journal-title":"Finite Fields Appl."},{"key":"1532_CR7","doi-asserted-by":"crossref","unstructured":"Huang P., Yaakobi E., Uchikawa H., Siegel P.H.: Cyclic linear binary locally repairable codes. In: 2015 IEEE Information Theory Workshop (ITW), Jerusalem, Israel, pp. 1\u20135 (2015).","DOI":"10.1109\/ITW.2015.7133128"},{"key":"1532_CR8","doi-asserted-by":"crossref","unstructured":"Huffman W.C., Kim J.-L., Sol\u00e9 P.: Concise Encyclopedia of Coding Theory, 1st edn. CRC Press, Boca Raton (2021).","DOI":"10.1201\/9781315147901"},{"key":"1532_CR9","doi-asserted-by":"crossref","unstructured":"Lally K.: Quasicyclic Codes of Index $$l$$ over $$\\mathbb{F}_q$$ Viewed as $$F[x]-$$Submodules of $$\\frac{\\mathbb{F} _{q^l}[x]}{\\langle x^m - 1\\rangle }$$, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes\u2014Lecture Notes in Comput. Sci., vol. 2643, pp. 244\u2013253. Springer, Berlin, Heidleberg (2003).","DOI":"10.1007\/3-540-44828-4_26"},{"key":"1532_CR10","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ffa.2005.11.006","volume":"13","author":"CJ Lim","year":"2007","unstructured":"Lim C.J.: Quasi-cyclic codes with cyclic constituent codes. Finite Fields Appl. 13, 516\u2013534 (2007).","journal-title":"Finite Fields Appl."},{"issue":"7","key":"1532_CR11","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"},{"issue":"2","key":"1532_CR12","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TIT.2018.2854717","volume":"65","author":"Y Luo","year":"2019","unstructured":"Luo Y., Xing C., Yuan C.: Optimal locally repairable codes of distance 3 and 4 via cyclic codes. IEEE Trans. Inf. Theory 65(2), 1048\u20131053 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1532_CR13","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/s10623-022-01009-3","volume":"90","author":"C Rajput","year":"2022","unstructured":"Rajput C., Bhaintwal M.: On the locality of quasi-cyclic codes over finite fields. Des. Codes Cryptogr. 90, 759\u2013777 (2022).","journal-title":"Des. Codes Cryptogr."},{"key":"1532_CR14","doi-asserted-by":"crossref","unstructured":"Shi M., Zhang Y., Sol\u00e9 P.: Notes on quasi-cyclic codes with cyclic constituent codes, vol. 190, pp. 193\u2013206 (2015).","DOI":"10.1007\/978-3-319-46310-0_12"},{"key":"1532_CR15","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0137027","volume":"37","author":"G Solomon","year":"1979","unstructured":"Solomon G., van Tilborg H.C.A.: A connection between block and convolutional codes. SIAM J. Appl. Math. 37, 358\u2013369 (1979).","journal-title":"SIAM J. Appl. Math."},{"issue":"8","key":"1532_CR16","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. Inf. Theory 60(8), 4661\u20134676 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1532_CR17","doi-asserted-by":"crossref","unstructured":"Tamo I., Barg A., Goparaju S., Calderbank R.: Cyclic LRC codes and their subfield subcodes. In: 2015 IEEE International Symposium on Information Theory (ISIT), Hong Kong, China, pp. 1262\u20131266 (2015).","DOI":"10.1109\/ISIT.2015.7282658"},{"issue":"4","key":"1532_CR18","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. Coding Theory 3(4), 345\u2013364 (2016).","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"2","key":"1532_CR19","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/LCOMM.2018.2882849","volume":"23","author":"P Tan","year":"2019","unstructured":"Tan P., Zhou Z., Yan H., Parampalli U.: Optimal cyclic locally repairable codes via cyclotomic polynomials. IEEE Commun. Lett. 23(2), 202\u2013205 (2019).","journal-title":"IEEE Commun. Lett."},{"key":"1532_CR20","first-page":"130","volume":"IT\u201313","author":"EJ Weldon Jr","year":"1970","unstructured":"Weldon E.J. Jr.: Long quasi-cyclic codes are good. IEEE Trans. Inf. Theory IT\u201313, 130 (1970).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1532_CR21","doi-asserted-by":"crossref","unstructured":"Wolfmann J.: New bounds on cyclic codes from algebraic curves. In: Coding Theory and Applications, Lecture Notes in Comput. Sci., vol. 388, pp. 47\u201362. Springer-Verlag, New York (1989).","DOI":"10.1007\/BFb0019846"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01532-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01532-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01532-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,8]],"date-time":"2025-05-08T04:03:28Z","timestamp":1746677008000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01532-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,20]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["1532"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01532-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,12,20]]},"assertion":[{"value":"4 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 September 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}