{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:03:08Z","timestamp":1764586988729,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T00:00:00Z","timestamp":1643846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["CRG\/2020\/003785"],"award-info":[{"award-number":["CRG\/2020\/003785"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10623-022-01009-3","type":"journal-article","created":{"date-parts":[[2022,2,3]],"date-time":"2022-02-03T14:04:15Z","timestamp":1643897055000},"page":"759-777","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the locality of quasi-cyclic codes over finite fields"],"prefix":"10.1007","volume":"90","author":[{"given":"Charul","family":"Rajput","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1471-5512","authenticated-orcid":false,"given":"Maheshanand","family":"Bhaintwal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,3]]},"reference":[{"issue":"7","key":"1009_CR1","doi-asserted-by":"publisher","first-page":"2065","DOI":"10.1109\/TIT.2002.1013145","volume":"48","author":"N Aydin","year":"2002","unstructured":"Aydin N., Ray-Chaudhuri D.K.: Quasi-cyclic codes over $$\\mathbb{Z}_4$$ and some new binary codes. IEEE Trans. Inf. Theory 48(7), 2065\u20132069 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1009_CR2","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ffa.2012.06.003","volume":"18","author":"M Barbier","year":"2012","unstructured":"Barbier M., Chabot C., Quintin G.: On quasi-cyclic codes as a generalization of cyclic codes. Finite Fields Appl. 18(5), 904\u2013919 (2012).","journal-title":"Finite Fields Appl."},{"issue":"5\u20136","key":"1009_CR3","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s00200-009-0110-8","volume":"20","author":"M Bhaintwal","year":"2009","unstructured":"Bhaintwal M., Wasan S.K.: On quasi-cyclic codes over $$\\mathbb{Z}_q$$. Appl. Algebra Eng. Commun. Comput. 20(5\u20136), 459\u2013480 (2009).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"3\u20134","key":"1009_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symbolic Comput. 24(3\u20134), 235\u2013265 (1997).","journal-title":"J. Symbolic Comput."},{"issue":"5","key":"1009_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0019-9958(69)90497-5","volume":"15","author":"C Chen","year":"1969","unstructured":"Chen C., Peterson W.W., Weldon E. Jr.: Some results on quasi-cyclic codes. Inf. Control 15(5), 407\u2013423 (1969).","journal-title":"Inf. Control"},{"issue":"1","key":"1009_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF01270398","volume":"4","author":"J Conan","year":"1993","unstructured":"Conan J., Seguin G.: Structural properties and enumeration of quasi cyclic codes. Appl. Algebra Eng. Commun. Comput. 4(1), 25\u201339 (1993).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"issue":"1\u20132","key":"1009_CR7","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/s12190-015-0885-7","volume":"50","author":"J Gao","year":"2016","unstructured":"Gao J., Shen L., Fu F.W.: Bounds on quasi-cyclic codes over finite chain rings. J. Appl. Math. Comput. 50(1\u20132), 577\u2013587 (2016).","journal-title":"J. Appl. Math. Comput."},{"issue":"11","key":"1009_CR8","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. Inf. Theory 58(11), 6925\u20136934 (2012).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1009_CR9","doi-asserted-by":"crossref","unstructured":"Goparaju S., Calderbank R.: Binary cyclic codes that are locally repairable. In: 2014 IEEE International Symposium on Information Theory, pp. 676\u2013680. IEEE (2014).","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"1009_CR10","volume-title":"Construction of Quasi-Cyclic Codes","author":"TA Gulliver","year":"1989","unstructured":"Gulliver T.A.: Construction of Quasi-Cyclic Codes. University of Victoria, Victoria (1989)."},{"key":"1009_CR11","volume-title":"Some Classes of Linear Codes: Observations About Their Structure, Construction, (Non-) Existence and Decoding","author":"PW Heijnen","year":"1999","unstructured":"Heijnen P.W.: Some Classes of Linear Codes: Observations About Their Structure, Construction, (Non-) Existence and Decoding. Technische Universiteit Eindhoven, Eindhoven (1999)."},{"key":"1009_CR12","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), pp. 1\u20135 (2015).","DOI":"10.1109\/ITW.2015.7133128"},{"key":"1009_CR13","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TIT.2019.2946627","volume":"66","author":"L Jin","year":"2020","unstructured":"Jin L., Kan H., Zhang Y.: Constructions of locally repairable codes with multiple recovering sets via rational function fields. IEEE Trans. Inf. Theory 66, 202\u2013209 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1009_CR14","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":"1","key":"1009_CR15","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1024715527805","volume":"30","author":"S Ling","year":"2003","unstructured":"Ling S., Sol\u00e9 P.: On the algebraic structure of quasi-cyclic codes II: chain rings. Des. Codes Cryptogr. 30(1), 113\u2013130 (2003).","journal-title":"Des. Codes Cryptogr."},{"key":"1009_CR16","doi-asserted-by":"crossref","unstructured":"Pamies-Juarez L., Hollmann H.D., Oggier F.: Locally repairable codes with multiple repair alternatives. In: 2013 IEEE International Symposium on Information Theory, pp. 892\u2013896. IEEE (2013).","DOI":"10.1109\/ISIT.2013.6620355"},{"issue":"10","key":"1009_CR17","doi-asserted-by":"publisher","first-page":"5843","DOI":"10.1109\/TIT.2014.2325570","volume":"60","author":"DS Papailiopoulos","year":"2014","unstructured":"Papailiopoulos D.S., Dimakis A.G.: Locally repairable codes. IEEE Trans. Inf. Theory 60(10), 5843\u20135855 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1009_CR18","doi-asserted-by":"crossref","unstructured":"Prakash N., Kamath G.M., Lalitha V., Kumar P.V.: Optimal linear codes with a local-error-correction property. In: 2012 IEEE International Symposium on Information Theory Proceedings, pp. 2776\u20132780. IEEE (2012).","DOI":"10.1109\/ISIT.2012.6284028"},{"issue":"8","key":"1009_CR19","doi-asserted-by":"publisher","first-page":"4481","DOI":"10.1109\/TIT.2016.2524510","volume":"62","author":"AS Rawat","year":"2016","unstructured":"Rawat A.S., Papailiopoulos D.S., Dimakis A.G., Vishwanath S.: Locality and availability in distributed storage. IEEE Trans. Inf. Theory 62(8), 4481\u20134493 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1009_CR20","doi-asserted-by":"publisher","first-page":"1745","DOI":"10.1109\/TIT.2004.831861","volume":"50","author":"GE S\u00e9guin","year":"2004","unstructured":"S\u00e9guin G.E.: A class of 1-generator quasi-cyclic codes. IEEE Trans. Inf. Theory 50(8), 1745\u20131753 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1009_CR21","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/18.850694","volume":"46","author":"I Siap","year":"2000","unstructured":"Siap I., Aydin N., Ray-Chaudhuri D.K.: New ternary quasi-cyclic codes with better minimum distances. IEEE Trans. Inf. Theory 46(4), 1554\u20131558 (2000). https:\/\/doi.org\/10.1109\/18.850694.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"1009_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. Inf. Theory 60(8), 4661\u20134676 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1009_CR23","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), pp. 1262\u20131266. IEEE (2015).","DOI":"10.1109\/ISIT.2015.7282658"},{"issue":"4","key":"1009_CR24","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":"1009_CR25","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/LCOMM.2018.2882849","volume":"23","author":"P Tan","year":"2018","unstructured":"Tan P., Zhou Z., Yan H., Parampalli U.: Optimal cyclic locally repairable codes via cyclotomic polynomials. IEEE Commun. Lett. 23(2), 202\u2013205 (2018).","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"1009_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-020-1120-1","volume":"39","author":"M Zeraatpisheh","year":"2020","unstructured":"Zeraatpisheh M., Esmaeili M., Gulliver T.A.: Quasi-cyclic codes: algebraic properties and applications. Comput. Appl. Math. 39(2), 1\u201321 (2020).","journal-title":"Comput. Appl. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01009-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01009-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01009-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T10:08:40Z","timestamp":1646647720000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01009-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,3]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1009"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01009-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,2,3]]},"assertion":[{"value":"23 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 January 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}