{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:52Z","timestamp":1774679692515,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T00:00:00Z","timestamp":1586908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T00:00:00Z","timestamp":1586908800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s00200-020-00430-2","type":"journal-article","created":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T16:03:31Z","timestamp":1586966611000},"page":"271-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimal RS-like LRC codes of arbitrary length"],"prefix":"10.1007","volume":"31","author":[{"given":"Charul","family":"Rajput","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maheshanand","family":"Bhaintwal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,15]]},"reference":[{"issue":"5","key":"430_CR1","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1109\/TIT.2018.2800042","volume":"64","author":"A Agarwal","year":"2018","unstructured":"Agarwal, A., Barg, A., Hu, S., Mazumdar, A., Tamo, I.: Combinatorial alphabet-dependent bounds for locally recoverable codes. IEEE Trans. Inf. Theory 64(5), 3481\u20133492 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"430_CR2","doi-asserted-by":"crossref","unstructured":"Cadambe, V., Mazumdar, A.: An upper bound on the size of locally recoverable codes. In: 2013 International Symposium on Network Coding (NetCod), pp. 1\u20135. IEEE, New York (2013)","DOI":"10.1109\/NetCod.2013.6570829"},{"issue":"11","key":"430_CR3","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":"430_CR4","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, New York (2014)","DOI":"10.1109\/ISIT.2014.6874918"},{"issue":"6","key":"430_CR5","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. Inf. Theory 65(6), 3662\u20133670 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"8","key":"430_CR6","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. Inf. Theory 65(8), 4658\u20134663 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"430_CR7","unstructured":"Kolosov, O., Barg, A., Tamo, I., Yadgar, G.: Optimal LRC codes for all lenghts $$n \\le q$$. arXiv preprint arXiv:1802.00157 (2018)"},{"issue":"2","key":"430_CR8","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1109\/TIT.2017.2713245","volume":"64","author":"J Liu","year":"2017","unstructured":"Liu, J., Mesnager, S., Chen, L.: New constructions of optimal locally recoverable codes via good polynomials. IEEE Trans. Inf. Theory 64(2), 889\u2013899 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"430_CR9","doi-asserted-by":"crossref","unstructured":"Liu, J., Mesnager, S., Tang, D.: Constructions of optimal locally recoverable codes via Dickson polynomials. In: Designs, Codes and Cryptography, pp. 1\u201322 (2020)","DOI":"10.1007\/s10623-020-00731-0"},{"issue":"1","key":"430_CR10","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TIT.2019.2939464","volume":"66","author":"G Micheli","year":"2019","unstructured":"Micheli, G.: Constructions of locally recoverable codes which are optimal. IEEE Trans. Inf. Theory 66(1), 167\u2013175 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"430_CR11","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, New York (2013)","DOI":"10.1109\/ISIT.2013.6620355"},{"issue":"10","key":"430_CR12","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":"430_CR13","doi-asserted-by":"crossref","unstructured":"Prakash, N., Lalitha, V., Kumar, P.V.: Codes with locality for two erasures. In: 2014 IEEE International Symposium on Information Theory, pp. 1962\u20131966. IEEE, New York (2014)","DOI":"10.1109\/ISIT.2014.6875176"},{"key":"430_CR14","doi-asserted-by":"crossref","unstructured":"Rawat, A.S., Papailiopoulos, D.S., Dimakis, A.G., Vishwanath, S.: Locality and availability in distributed storage, pp. 4481\u20134493. IEEE, New York (2016)","DOI":"10.1109\/TIT.2016.2524510"},{"key":"430_CR15","doi-asserted-by":"crossref","unstructured":"Silberstein, N., Rawat, A.S., Koyluoglu, O.O., Vishwanath, S.: Optimal locally repairable codes via rank-metric codes. In: 2013 IEEE International Symposium on Information Theory, pp. 1819\u20131823. IEEE, New York (2013)","DOI":"10.1109\/ISIT.2013.6620541"},{"issue":"8","key":"430_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"},{"issue":"6","key":"430_CR17","doi-asserted-by":"publisher","first-page":"3070","DOI":"10.1109\/TIT.2016.2518663","volume":"62","author":"I Tamo","year":"2016","unstructured":"Tamo, I., Barg, A., Frolov, A.: Bounds on the parameters of locally recoverable codes. IEEE Trans. Inf. Theory 62(6), 3070\u20133083 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"430_CR18","doi-asserted-by":"publisher","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 (2016). https:\/\/doi.org\/10.1504\/IJICOT.2016.079496","DOI":"10.1504\/IJICOT.2016.079496"},{"issue":"12","key":"430_CR19","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.S., Dimakis, A.G.: Optimal locally repairable codes and connections to matroid theory. IEEE Trans. Inf. Theory 62(12), 6661\u20136671 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"430_CR20","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."},{"key":"430_CR21","unstructured":"Xing, C., Yuan, C.: Construction of optimal locally recoverable codes and connection with hypergraph. arXiv preprint arXiv:1811.09142 (2018)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00430-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-020-00430-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-020-00430-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,15]],"date-time":"2021-04-15T07:35:16Z","timestamp":1618472116000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-020-00430-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,15]]},"references-count":21,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["430"],"URL":"https:\/\/doi.org\/10.1007\/s00200-020-00430-2","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,15]]},"assertion":[{"value":"31 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}