{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T11:44:15Z","timestamp":1775043855581,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T00:00:00Z","timestamp":1760572800000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s12095-025-00842-2","type":"journal-article","created":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:54:28Z","timestamp":1760612068000},"page":"315-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Explicit constructions of optimal vector locally repairable codes"],"prefix":"10.1007","volume":"18","author":[{"given":"Xing","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,16]]},"reference":[{"key":"842_CR1","doi-asserted-by":"crossref","unstructured":"Dimakis A., Godfrey P., Wainwright M., Ramchandran K.: Network coding for distributed storage systems. In: Proc. IEEE Int. Conf. Comput. Commun. (INFOCOM), pp. 2000-2008 (2007)","DOI":"10.1109\/INFCOM.2007.232"},{"issue":"9","key":"842_CR2","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"A Dimakis","year":"2010","unstructured":"Dimakis, A., Godfrey, P., Wu, Y., Wainwright, M., Ramchandran, K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"842_CR3","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1109\/TIT.2011.2159049","volume":"57","author":"KV Rashmi","year":"2011","unstructured":"Rashmi, K.V., Shah, N.B., Kumar, P.V.: Optimal exact-regenerating codes for distributed storage at the msr and mbr points via a product-matrix construction. IEEE Trans. Inf. Theory 57(8), 5227\u20135239 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"842_CR4","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1109\/TIT.2017.2661313","volume":"63","author":"M Ye","year":"2017","unstructured":"Ye, M., Barg, A.: Explicit constructions of high-rate mds array codes with optimal repair bandwidth. IEEE Trans. Inf. Theory 63(4), 2001\u20132014 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"842_CR5","doi-asserted-by":"publisher","first-page":"6307","DOI":"10.1109\/TIT.2017.2730863","volume":"67","author":"M Ye","year":"2017","unstructured":"Ye, M., Barg, A.: Explicit constructions of optimal-access mds codes with nearly optimal sub-packetization. IEEE Trans. Inf. Theory 67(10), 6307\u20136317 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"842_CR6","doi-asserted-by":"publisher","first-page":"6506","DOI":"10.1109\/TIT.2018.2810095","volume":"64","author":"AS Rawat","year":"2018","unstructured":"Rawat, A.S., Tamo, I., Guruswami, V., Efremenko, K.: Mds code constructions with small sub-packetization and near-optimal repair bandwidth. IEEE Trans. Inf. Theory 64(10), 6506\u20136525 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"842_CR7","doi-asserted-by":"publisher","first-page":"2162","DOI":"10.1109\/TIT.2020.3036386","volume":"67","author":"J Li","year":"2021","unstructured":"Li, J., Liu, Y., Tang, X.: A systematic construction of mds codes with small sub-packetization level and near-optimal repair bandwidth. IEEE Trans. Inf. Theory 67(4), 2162\u20132180 (2021)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"842_CR8","doi-asserted-by":"publisher","first-page":"6749","DOI":"10.1109\/TIT.2020.3023110","volume":"66","author":"V Guruswami","year":"2020","unstructured":"Guruswami, V., Lokam, S.V., Jayaraman, S.V.M.: $$\\epsilon$$-msr codes: contacting fewer code blocks for exact repair. IEEE Trans. Inf. Theory 66(11), 6749\u20136761 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"842_CR9","first-page":"5802","volume":"63","author":"KV Rashmi","year":"2017","unstructured":"Rashmi, K.V., Shah, N.B., Ramchandran, K.: A piggybacking design framework for read-and download-efficient distributed storage codes. IEEE Trans. Inf. Theory 63(9), 5802\u20135820 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"842_CR10","doi-asserted-by":"publisher","first-page":"3245","DOI":"10.1109\/TCOMM.2018.2805347","volume":"66","author":"S Yuan","year":"2018","unstructured":"Yuan, S., Huang, Q., Wang, Z.: A repair-efficient coding for distributed storage systems under piggybacking framework. IEEE Trans. Communications 66(8), 3245\u20133254 (2018)","journal-title":"IEEE Trans. Communications"},{"issue":"12","key":"842_CR11","doi-asserted-by":"publisher","first-page":"8193","DOI":"10.1109\/TCOMM.2019.2941933","volume":"67","author":"GY Li","year":"2019","unstructured":"Li, G.Y., Lin, X., Tang, X.: An efficient one-to-one piggybacking design for distributed storage systems. IEEE Trans. Communications 67(12), 8193\u20138205 (2019)","journal-title":"IEEE Trans. Communications"},{"issue":"9","key":"842_CR12","first-page":"5684","volume":"63","author":"V Guruswami","year":"2017","unstructured":"Guruswami, V., Wootters, M.: Repairing reed-solomon codes. IEEE Trans. Inf. Theory 63(9), 5684\u20135698 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"842_CR13","doi-asserted-by":"crossref","unstructured":"Dau H., Milenkovic O.: Optimal repair schemes for some families of full-length Reed-Solomon codes. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 346-350 (2017)","DOI":"10.1109\/ISIT.2017.8006547"},{"issue":"1","key":"842_CR14","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/LCOMM.2019.2950922","volume":"24","author":"W Li","year":"2020","unstructured":"Li, W., Wang, Z., Jafarkhani, H.: Repairing reed-solomon codes over $$gf(2^l)$$. IEEE Comm. Lett. 24(1), 34\u201337 (2020)","journal-title":"IEEE Comm. Lett."},{"key":"842_CR15","doi-asserted-by":"crossref","unstructured":"Berman A., Buzaglo S., Dor A., Shany Y., Tamo I.: Repairing Reed-Solomon codes evaluated on subspaces. In: Proc. IEEE Int. Symp. Inform. Theory (ISIT), pp. 867-871 (2021)","DOI":"10.1109\/ISIT45174.2021.9517961"},{"issue":"11","key":"842_CR16","doi-asserted-by":"publisher","first-page":"2924","DOI":"10.1109\/LCOMM.2023.3319653","volume":"27","author":"X Lin","year":"2023","unstructured":"Lin, X.: A note on bandwidth-optimal repair scheme for reed-solomon codes with low repair locality. IEEE Commun. Lett. 27(11), 2924\u20132927 (2023)","journal-title":"IEEE Commun. Lett."},{"key":"842_CR17","doi-asserted-by":"crossref","unstructured":"Oggier F., Datta A.: Self-repairing homomorphic codes for distributed storage systems. In: Proc. IEEE Int. Conf. Comput. Commun. (INFOCOM), pp. 1215-1223 (2011)","DOI":"10.1109\/INFCOM.2011.5934901"},{"issue":"11","key":"842_CR18","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"},{"issue":"8","key":"842_CR19","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"},{"issue":"10","key":"842_CR20","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"},{"issue":"1","key":"842_CR21","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. Inf. Theory 60(1), 212\u2013236 (2014)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"842_CR22","doi-asserted-by":"crossref","unstructured":"Kamath G.M., Prakash N., Lalitha V., Kumar P.: Codes with local regeneration. In: Proc. IEEE Int. Symp. Information Theory, pp. 1606-1610 (2013)","DOI":"10.1109\/ISIT.2013.6620498"},{"issue":"5","key":"842_CR23","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.H., Yuen, C., Li, T.J.: Optimal locally repairable linear codes. IEEE J. Sel. Areas Commun. 32(5), 1019\u20131036 (2014)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"842_CR24","doi-asserted-by":"crossref","unstructured":"Westerb$$\\ddot{a}$$ck T., Freij-Hollanti R., Ernvall T., Hollanti C.: On the combinatorics of locally repairable codes via matroid theory. IEEE Trans. Inf. Theory, 62(10), 5296-5315 (2016)","DOI":"10.1109\/TIT.2016.2598149"},{"issue":"8","key":"842_CR25","doi-asserted-by":"publisher","first-page":"5060","DOI":"10.1109\/TIT.2022.3161613","volume":"68","author":"H Cai","year":"2022","unstructured":"Cai, H., Fan, C., Miao, Y., Schwartz, M., Tang, X.: Optimal locally repairable codes: an improved bound and constructions. IEEE Trans. Inf. Theory 68(8), 5060\u20135074 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"842_CR26","doi-asserted-by":"crossref","unstructured":"Papailiopoulos D.S., Luo J., Dimakis A.G., Huang C., Li J.: Simple regenerating codes: network coding for cloud storage. In: Proc. IEEE Int. Conf. Comput. Commun. (INFOCOM), pp. 2801-2805 (2012)","DOI":"10.1109\/INFCOM.2012.6195703"},{"key":"842_CR27","doi-asserted-by":"crossref","unstructured":"Golowich L., Guruswami V.: Quantum locally recoverable codes. In: Proc. Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), pp. 5512-5522 (2025)","DOI":"10.1137\/1.9781611978322.188"},{"issue":"3","key":"842_CR28","doi-asserted-by":"publisher","first-page":"1794","DOI":"10.1109\/TIT.2025.3533494","volume":"71","author":"G Luo","year":"2025","unstructured":"Luo, G., Chen, B., Ezerman, M.F., Ling, S.: Bounds and constructions of quantum locally recoverable codes from quantum css codes. IEEE Trans. Inf. Theory 71(3), 1794\u20131802 (2025)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00842-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-025-00842-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00842-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:11:58Z","timestamp":1775038318000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-025-00842-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,16]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["842"],"URL":"https:\/\/doi.org\/10.1007\/s12095-025-00842-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,16]]},"assertion":[{"value":"15 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The author agrees to publish this article.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}