{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T19:38:14Z","timestamp":1767382694570,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437460","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"2072-2076","source":"Crossref","is-referenced-by-count":6,"title":["Load-Balanced Fractional Repetition Codes"],"prefix":"10.1109","author":[{"given":"Alexandra","family":"Porter","sequence":"first","affiliation":[]},{"given":"Shashwat","family":"Silas","sequence":"additional","affiliation":[]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875176"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1837","DOI":"10.1109\/TIT.2011.2173792","article-title":"Distributed storage codes with repair-by-transfer and nonachievability of interior points on the storage-bandwidth tradeoff","volume":"58","author":"nihar","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-17296-5_36"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2442231"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140523"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2014.6811237"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1109\/LCOMM.2015.2415495","article-title":"Heterogeneity-aware codes with uncoded repair for distributed storage systems","volume":"19","author":"bing","year":"2015","journal-title":"IEEE Communications Letters"},{"key":"ref17","first-page":"1","article-title":"On low repair complexity storage codes via group divisible designs","author":"bing","year":"2014","journal-title":"Computers and Communication (ISCC) 2014 IEEE Symposium on"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707092"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"4539","DOI":"10.1109\/TIT.2010.2054295","article-title":"Network coding for distributed storage systems","volume":"56","author":"alexandros","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"journal-title":"Topological Graph Theory","year":"1987","author":"gross","key":"ref6"},{"key":"ref5","article-title":"Dynamic cage survey","volume":"15","author":"exoo","year":"2008","journal-title":"Electron J Combin"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2531720"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/jctb.1994.1036","article-title":"New constructions of bipartite graphs on m, n vertices with many edges and without small cycles","volume":"61","author":"felix","year":"1994","journal-title":"Journal of Combinatorial Theory Series B"},{"journal-title":"Batch codes through dense graphs without short cycles","year":"2014","author":"alexandros","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006508"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/e18120441"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437460.pdf?arnumber=8437460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:09:14Z","timestamp":1598227754000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437460\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437460","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}