{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T21:21:52Z","timestamp":1725657712953},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006888","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"2043-2047","source":"Crossref","is-referenced-by-count":3,"title":["\u220a-MSR codes with small sub-packetization"],"prefix":"10.1109","author":[{"given":"Ankit Singh","family":"Rawat","sequence":"first","affiliation":[]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[]},{"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[]},{"given":"Klim","family":"Efremenko","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref12","article-title":"Rethinking erasure codes for cloud file systems: Minimizing I\/O for recovery and degraded reads","author":"khan","year":"2012","journal-title":"Proc USENIX Conf File and Storage Technologies (FAST '10)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620242"},{"key":"ref14","article-title":"New results on MSR codes","author":"tamo","year":"2016","journal-title":"Information Theory and Applications Workshop (ITA)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.137"},{"article-title":"$\\epsilon -\\text{MSR}$ codes with small sub-packetization","year":"0","author":"rawat","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref3","article-title":"Communication efficient secret sharing","author":"huang","year":"2015","journal-title":"CoRR"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref8","article-title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization","author":"ye","year":"2016","journal-title":"CoRR"},{"key":"ref7","article-title":"Explicit constructions of high-rate MDS array codes with optimal repair bandwidth","author":"ye","year":"2016","journal-title":"CoRR"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref9","article-title":"An explicit, coupled-layer construction of a high-rate MSR code with low sub-packetization level, small field size and all-node repair","author":"sasidharan","year":"2016","journal-title":"CoRR"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08006888.pdf?arnumber=8006888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T19:33:32Z","timestamp":1513193612000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006888\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006888","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}