{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:59:27Z","timestamp":1774990767315,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541264","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"76-80","source":"Crossref","is-referenced-by-count":8,"title":["Minimum storage regenerating codes for all parameters"],"prefix":"10.1109","author":[{"given":"Arman","family":"Fazeli","sequence":"first","affiliation":[{"name":"Jacobs School of Engineering, University of California San Diego, La Jolla, 92093, USA"}]},{"given":"Sreechakra","family":"Goparaju","sequence":"additional","affiliation":[{"name":"Jacobs School of Engineering, University of California San Diego, La Jolla, 92093, USA"}]},{"given":"Alexander","family":"Vardy","sequence":"additional","affiliation":[{"name":"Jacobs School of Engineering, University of California San Diego, La Jolla, 92093, USA"}]}],"member":"263","reference":[{"key":"ref10","first-page":"2974","article-title":"Asymptotic Interference Aliqnment for Optimal Repair of MDS codes in Distributed Storage","volume":"59","author":"cadambe","year":"2013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190343"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120328"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283041"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513263"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033733"},{"key":"ref17","article-title":"Progress on High-rate MSR Codes: Enabling Arbitrary Number of Helper Nodes","author":"rawat","year":"2016","journal-title":"ArXiv org"},{"key":"ref18","article-title":"Minimum storage regenerating codes for all parameters","author":"goparaju","year":"0","journal-title":"arXiv 1602 04496"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref3","article-title":"Repairing Reed-Solomon Codes","author":"guruswami","year":"2015","journal-title":"arXiv 1509 04764"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"key":"ref8","article-title":"Searching for Minimum Storage Regenerating Codes","author":"cullina","year":"2009","journal-title":"ArXiv org"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205898"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"ref1","article-title":"The Hadoop Distributed File System: Architecture and Design","author":"borthakur","year":"2007","journal-title":"Apache Hadoop"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2134170"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541264.pdf?arnumber=7541264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:51:31Z","timestamp":1774986691000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541264\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541264","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}