{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:37:08Z","timestamp":1775054228120,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1109\/allerton.2014.7028491","type":"proceedings-article","created":{"date-parts":[[2015,2,5]],"date-time":"2015-02-05T19:24:07Z","timestamp":1423164247000},"page":"459-466","source":"Crossref","is-referenced-by-count":4,"title":["When and by how much can helper node selection improve regenerating codes?"],"prefix":"10.1109","author":[{"given":"Imad","family":"Ahmad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chih-Chun","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","author":"suh","year":"0","journal-title":"On the Existence of Optimal Exact-Repair MDS Codes for Distributed Storage"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205898"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274265"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/4236.957894"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394538"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2134170"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"20","volume":"2","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"2","author":"cadambe","year":"0","journal-title":"Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair Are Asymptotically Equally Efficient"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028491"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195703"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2013.6502947"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/945449.945450"},{"key":"4","first-page":"1510","article-title":"Fractional repetition codes for repair in distributed storage systems","author":"el rouayheb","year":"2010","journal-title":"Proc Annu Allert Conf Commun Contr Comput"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284027"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620277"}],"event":{"name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","location":"Monticello, IL, USA","start":{"date-parts":[[2014,9,30]]},"end":{"date-parts":[[2014,10,3]]}},"container-title":["2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7008053\/7028426\/07028491.pdf?arnumber=7028491","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T04:40:41Z","timestamp":1490330441000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7028491\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/allerton.2014.7028491","relation":{},"subject":[],"published":{"date-parts":[[2014,9]]}}}