{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:56Z","timestamp":1774679696359,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T00:00:00Z","timestamp":1644969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["2110113"],"award-info":[{"award-number":["2110113"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["2104489"],"award-info":[{"award-number":["2104489"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["852953"],"award-info":[{"award-number":["852953"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["1030\/15"],"award-info":[{"award-number":["1030\/15"]}],"id":[{"id":"10.13039\/501100003977","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,4]]},"DOI":"10.1007\/s10623-022-01020-8","type":"journal-article","created":{"date-parts":[[2022,2,16]],"date-time":"2022-02-16T14:02:46Z","timestamp":1645020166000},"page":"939-945","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A construction of maximally recoverable codes"],"prefix":"10.1007","volume":"90","author":[{"given":"Alexander","family":"Barg","sequence":"first","affiliation":[]},{"given":"Zitan","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,16]]},"reference":[{"key":"1020_CR1","doi-asserted-by":"crossref","unstructured":"Alon N.: Testing subgraphs in large graphs. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 434\u2013441, (2001).","DOI":"10.1109\/SFCS.2001.959918"},{"key":"1020_CR2","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1073\/pnas.32.12.331","volume":"32","author":"FA Behrend","year":"1946","unstructured":"Behrend F.A.: On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. USA 32, 331\u2013332 (1946).","journal-title":"Proc. Nat. Acad. Sci. USA"},{"issue":"1","key":"1020_CR3","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TIT.2021.3120016","volume":"68","author":"H Cai","year":"2022","unstructured":"Cai H., Miao Y., Schwartz M., Tang X.: A construction of maximally recoverable codes with order-optimal field size. IEEE Trans. Inf. Theory 68(1), 204\u2013212 (2022).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1020_CR4","doi-asserted-by":"publisher","first-page":"3692","DOI":"10.1109\/TIT.2018.2890201","volume":"65","author":"R Gabrys","year":"2019","unstructured":"Gabrys R., Yaakobi E., Blaum M., Siegel P.H.: Constructions of partial MDS codes over small fields. IEEE Trans. Inf. Theory 65(6), 3692\u20133701 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1020_CR5","doi-asserted-by":"publisher","first-page":"5245","DOI":"10.1109\/TIT.2014.2332338","volume":"60","author":"P Gopalan","year":"2014","unstructured":"Gopalan P., Huang C., Jenkins B., Yekhanin S.: Explicit maximally recoverable codes with locality. IEEE Trans. Inf. Theory 60(9), 5245\u20135256 (2014).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1020_CR6","doi-asserted-by":"publisher","first-page":"6066","DOI":"10.1109\/TIT.2020.2990981","volume":"66","author":"S Gopi","year":"2020","unstructured":"Gopi S., Guruswami V., Yekhanin S.: Maximally recoverable LRCs: a field size lower bound and constructions for few heavy parities. IEEE Trans. Inf. Theory 66(10), 6066\u20136083 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1020_CR7","doi-asserted-by":"publisher","first-page":"6133","DOI":"10.1109\/TIT.2020.2988459","volume":"66","author":"V Guruswami","year":"2020","unstructured":"Guruswami V., Jin L., Xing C.: Constructions of maximally recoverable local reconstruction codes via function fields. IEEE Trans. Inf. Theory 66(10), 6133\u20136143 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"1020_CR8","doi-asserted-by":"publisher","first-page":"7790","DOI":"10.1109\/TIT.2019.2924888","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as U., Kschischang F.R.: Universal and dynamic locally repairable codes with maximal recoverability via sum-rank codes. IEEE Trans. Inf. Theory 65(12), 7790\u20137805 (2019).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1020_CR9","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10623-019-00705-x","volume":"88","author":"A Neri","year":"2020","unstructured":"Neri A., Horlemann-Trautmann A.-L.: Random construction of partial MDS codes. Des. Codes Cryptogr. 88(4), 711\u2013725 (2020).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01020-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01020-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01020-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T19:13:35Z","timestamp":1648235615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01020-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,16]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1020"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01020-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,16]]},"assertion":[{"value":"18 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}