{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T06:23:45Z","timestamp":1648967025453},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T00:00:00Z","timestamp":1583798400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T00:00:00Z","timestamp":1583798400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10623-020-00746-7","type":"journal-article","created":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T06:03:28Z","timestamp":1583820208000},"page":"1687-1698","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computing sharp recovery structures for locally recoverable codes"],"prefix":"10.1007","volume":"88","author":[{"given":"Irene","family":"M\u00e1rquez-Corbella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Mart\u00ednez-Moro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Munuera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,10]]},"reference":[{"issue":"5","key":"746_CR1","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1109\/18.705584","volume":"44","author":"A Ashikhmin","year":"1998","unstructured":"Ashikhmin A., Barg A.: Minimal vectors in linear codes. IEEE Trans. Inf. Theory 44(5), 2010\u20132017 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"746_CR2","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., Vladut S.: Locally recoverable codes on algebraic curves. IEEE Trans. Inf. Theory 63, 4928\u20134939 (2017).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"746_CR3","volume-title":"Locally Recoverable Codes from Algebraic Curves and Surfaces. Algebraic Geometry for Coding Theory and Cryptography 95127. Association for Women in Mathematics Series","author":"A Barg","year":"2017","unstructured":"Barg A., Haymaker K., Howe E., Matthews G., Varilly-Alvarado A.: Locally Recoverable Codes from Algebraic Curves and Surfaces. Algebraic Geometry for Coding Theory and Cryptography 95127. Association for Women in Mathematics Series, vol. 9. Springer, Cham (2017)."},{"issue":"3","key":"746_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp E.R., McEliece R.J., van Tilborg H.C.A.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"746_CR5","unstructured":"Bertilsson M., Ingemarsson I.: A construction of practical secret sharing schemes using linear block codes. In: Advances in Cryptology\u2014AUSCRYPT\u201992, vol. 718, pp. 67\u201379 (1992)."},{"issue":"4","key":"746_CR6","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1504\/IJICOT.2016.079494","volume":"3","author":"M Blaum","year":"2016","unstructured":"Blaum M., Hetzler S.R.: Integrated interleaved codes as locally recoverable codes: properties and performance. Int. J. Inf. Coding Theory 3(4), 324\u2013344 (2016).","journal-title":"Int. J. Inf. Coding Theory"},{"issue":"5","key":"746_CR7","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s00200-008-0080-2","volume":"19","author":"M Borges-Quintana","year":"2008","unstructured":"Borges-Quintana M., Borges-Trenard M.A., Fitzpatrick P., Mart\u00ednez-Moro E.: Gr\u00f6bner bases and combinatorics for binary codes. Appl. Algebra Eng. Commun. Comput. 19(5), 393\u2013411 (2008).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"746_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008247720662","volume":"10","author":"A Faldum","year":"1997","unstructured":"Faldum A., Willems W.: Codes of small defect. Des. Codes Cryptogr. 10, 341\u2013350 (1997).","journal-title":"Des. Codes Cryptogr."},{"issue":"11","key":"746_CR9","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":"2","key":"746_CR10","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0216026","volume":"16","author":"JD Horton","year":"1987","unstructured":"Horton J.D.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput. 16(2), 358\u2013366 (1987).","journal-title":"SIAM J. Comput."},{"key":"746_CR11","unstructured":"Jin L., Ma L., Xing C.: Construction of optimal locally repairable codes via automorphism groups of rational function fields. arXiv:1710.09638 (2017)."},{"issue":"2","key":"746_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.3934\/amc.2016003","volume":"10","author":"I M\u00e1rquez-Corbella","year":"2016","unstructured":"M\u00e1rquez-Corbella I., Mart\u00ednez-Moro E., Su\u00e1rez-Canedo E.: On the ideal associated to a linear code. Adv. Math. Commun. 10(2), 229\u2013254 (2016).","journal-title":"Adv. Math. Commun."},{"key":"746_CR13","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 276\u2013279 (1993)."},{"key":"746_CR14","unstructured":"MinT: Database for optimal parameters of $$(t, m, s)$$-nets, $$(t, s)$$-sequences, orthogonal arrays, linear codes and OOAs. http:\/\/mint.sbg.ac.at\/index.php."},{"issue":"10","key":"746_CR15","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":"746_CR16","unstructured":"SageMath: The Sage Mathematics Software System (Version 8.4). The Sage Developers. http:\/\/www.sagemath.org (2018)."},{"issue":"1","key":"746_CR17","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1109\/TIT.2013.2288784","volume":"60","author":"AS Rawat","year":"2014","unstructured":"Rawat A.S., Koyluoglu O.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"},{"issue":"8","key":"746_CR18","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":"746_CR19","unstructured":"Tamo I., Barg A., Goparaju S., Calderbank R.: Cyclic LRC codes and their subfield subcodes. In: Proceedings of IEEE International Symposium on Information Theory, Hong Kong, pp. 1262\u20131266 (2015)."},{"key":"746_CR20","doi-asserted-by":"publisher","first-page":"2673","DOI":"10.1109\/TIT.2018.2884075","volume":"65","author":"I Tamo","year":"2019","unstructured":"Tamo I., Ye M., Barg A.: The repair problem for Reed-Solomon codes: optimal repair of single and multiple erasures with almost optimal node size. IEEE Trans. Inf. Theory 65, 2673\u20132695 (2019).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00746-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-020-00746-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-020-00746-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,10]],"date-time":"2021-03-10T00:26:15Z","timestamp":1615335975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-020-00746-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,10]]},"references-count":20,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["746"],"URL":"https:\/\/doi.org\/10.1007\/s10623-020-00746-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,10]]},"assertion":[{"value":"16 July 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}