{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:32Z","timestamp":1740122552344,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 1619189"],"award-info":[{"award-number":["CCF 1619189"]}],"id":[{"id":"10.13039\/100000001","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,12]]},"DOI":"10.1007\/s10623-021-01003-1","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T16:03:15Z","timestamp":1646064195000},"page":"2923-2941","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Johnson graph codes"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2436-3944","authenticated-orcid":false,"given":"Iwan","family":"Duursma","sequence":"first","affiliation":[]},{"given":"Xiao","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,28]]},"reference":[{"issue":"9","key":"1003_CR1","doi-asserted-by":"publisher","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","volume":"56","author":"AG Dimakis","year":"2010","unstructured":"Dimakis A.G., Godfrey P.B., Wu Y., Wainwright M.J., Ramchandran K.: Network coding for distributed storage systems. IEEE Trans. Inf. Theory 56(9), 4539\u20134551 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1003_CR2","unstructured":"Duursma I., Li X.: Johnson graph codes. Preprint at http:\/\/arxiv.org\/abs\/1912.10388"},{"key":"1003_CR3","unstructured":"Duursma I., Li X., Wang H.-P.: Multilinear algebra for distributed storage. Preprint at http:\/\/arxiv.org\/abs\/2006.08911"},{"issue":"12","key":"1003_CR4","doi-asserted-by":"publisher","first-page":"6683","DOI":"10.1109\/TIT.2016.2616137","volume":"62","author":"M Elyasi","year":"2016","unstructured":"Elyasi M., Mohajer S.: Determinant coding: a novel framework for exact-repair regenerating codes. IEEE Trans. Inf. Theory 62(12), 6683\u20136697 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1003_CR5","doi-asserted-by":"crossref","unstructured":"Elyasi M., Mohajer S.: A cascade code construction for (n, k, d) distributed storage systems. In: 2018 IEEE ISIT Proceedings, pp.\u00a01241\u20131245 (2018)","DOI":"10.1109\/ISIT.2018.8437696"},{"issue":"12","key":"1003_CR6","doi-asserted-by":"publisher","first-page":"7490","DOI":"10.1109\/TIT.2020.3033338","volume":"66","author":"M Elyasi","year":"2020","unstructured":"Elyasi M., Mohajer S.: Cascade codes for distributed storage systems. IEEE Trans. Inf. Theory 66(12), 7490\u20137527 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1003_CR7","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1016\/j.ffa.2004.09.002","volume":"11","author":"SR Ghorpade","year":"2005","unstructured":"Ghorpade S.R., Tsfasman M.A.: Schubert varieties, linear codes and enumerative combinatorics. Finite Fields Appl. 11(4), 684\u2013699 (2005).","journal-title":"Finite Fields Appl."},{"issue":"11","key":"1003_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"},{"issue":"8","key":"1003_CR9","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":"2","key":"1003_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0166-218X(90)90112-P","volume":"28","author":"CT Ryan","year":"1990","unstructured":"Ryan C.T., Ryan K.M.: The minimum weight of the Grassmann codes $$C(k, n)$$. Discret. Appl. Math. 28(2), 149\u2013156 (1990).","journal-title":"Discret. Appl. Math."},{"key":"1003_CR11","doi-asserted-by":"crossref","unstructured":"Sasidharan B., Vajha M., Kumar P.V.: An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and $$d < (n-1)$$. In: 2017 IEEE ISIT Proceedings, pp. 2048\u20132052 (2017)","DOI":"10.1109\/ISIT.2017.8006889"},{"key":"1003_CR12","doi-asserted-by":"crossref","unstructured":"Senthoor K., Sasidharan B., Kumar P.V.: Improved layered regenerating codes characterizing the exact-repair storage-repair bandwidth tradeoff for certain parameter sets. In: 2015 IEEE ISIT Proceedings, pp.\u00a02051\u20132055, (2015)","DOI":"10.1109\/ITW.2015.7133121"},{"issue":"4","key":"1003_CR13","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.1109\/TIT.2015.2408595","volume":"61","author":"C Tian","year":"2014","unstructured":"Tian C., Sasidharan B., Aggarwal V., Vaishampayan V., Kumar P.V.: Layered exact-repair regenerating codes via embedded error correction and block designs. IEEE Trans. Inf. Theory 61(4), 1933\u20131947 (2014).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01003-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-01003-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01003-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,11]],"date-time":"2022-11-11T08:08:05Z","timestamp":1668154085000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-01003-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,28]]},"references-count":13,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["1003"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-01003-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,2,28]]},"assertion":[{"value":"17 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}