{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:15:45Z","timestamp":1775913345288,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF1422955"],"award-info":[{"award-number":["CCF1422955"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF1618603"],"award-info":[{"award-number":["CCF1618603"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/tit.2017.2730863","type":"journal-article","created":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T18:15:22Z","timestamp":1500920122000},"page":"6307-6317","source":"Crossref","is-referenced-by-count":144,"title":["Explicit Constructions of Optimal-Access MDS Codes With Nearly Optimal Sub-Packetization"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1351-8880","authenticated-orcid":false,"given":"Min","family":"Ye","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8972-4413","authenticated-orcid":false,"given":"Alexander","family":"Barg","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2658660"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897525"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"ref28","author":"sasidharan","year":"2016","journal-title":"An explicit coupled-layer construction of a high-rate MSR code with low subpacketization level small field size and all-node repair"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874991"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ITWF.2015.7360722"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205898"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190343"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033730"},{"key":"ref2","first-page":"1855","article-title":"Array codes","volume":"2","author":"blaum","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref20","article-title":"Optimal repair of Reed-Solomon codes: Achieving the cut-set bound","author":"tamo","year":"2017","journal-title":"Proc IEEE Ann Symp Foundations of Computer Science (FOCS)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref24","author":"ahmad","year":"2016","journal-title":"When can helper node selection improve regenerating codes? Part I Graph-based analysis"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref25","author":"ahmad","year":"2016","journal-title":"When can helper node selection improve regenerating codes? Part II An explicit exact-repair code construction"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/8036324\/7990181-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8036324\/07990181.pdf?arnumber=7990181","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:52:48Z","timestamp":1649443968000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7990181\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":28,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2730863","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}