{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:51:45Z","timestamp":1773377505340,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849278","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"226-230","source":"Crossref","is-referenced-by-count":0,"title":["Explicit constructions of MSR codes for the rack-aware storage model"],"prefix":"10.1109","author":[{"given":"Zitan","family":"Chen","sequence":"first","affiliation":[{"name":"ISR\/Department of ECE, University of Maryland, College Park, MD, 20742, USA"}]},{"given":"Alexander","family":"Barg","sequence":"additional","affiliation":[{"name":"ISR\/Department of ECE, University of Maryland, College Park, MD, 20742, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884075"},{"key":"ref12","first-page":"139","article-title":"Clay codes: Moulding MDS codes to yield an MSR code","author":"vajha","year":"2018","journal-title":"16th USENIX Conference on File and Storage Technologies (FAST 18)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref4","article-title":"Rack-aware regenerating codes for data centers","author":"hou","year":"2018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2013.72"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3149349"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541298"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437458"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620424"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2941744"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2837860"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849278.pdf?arnumber=8849278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:08Z","timestamp":1773347648000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849278\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849278","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}