{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T06:09:20Z","timestamp":1725430160294},"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.8006762","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T14:54:37Z","timestamp":1504018477000},"page":"1416-1420","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotically optimal regenerating codes over any field"],"prefix":"10.1109","author":[{"given":"Netanel","family":"Raviv","sequence":"first","affiliation":[]}],"member":"263","reference":[{"journal-title":"Asymptotically optimal regenerating codes over any field","year":"2016","author":"raviv","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541261"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511808968"},{"journal-title":"An explicit coupled-layer construction of a high-rate MSR code with low sub-packetization level small field size and all-node repair","year":"2016","author":"sasidharan","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0604003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/2690850"},{"key":"ref16","first-page":"1","article-title":"Deterministic regenerating codes for distributed storage","author":"wu","year":"2007","journal-title":"Allerton Conference on Control Computing and Communication"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"journal-title":"Explicit constructions of optimal-access MDS codes with nearly optimal sub-packetization","year":"2016","author":"ye","key":"ref18"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717907"},{"journal-title":"Fundamentals of Error-Correcting Codes","year":"2010","author":"huffman","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2378255"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172769"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0117057"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541296"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541491"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1112\/S0024609396001828"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"}],"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\/08006762.pdf?arnumber=8006762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T14:57:53Z","timestamp":1513177073000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006762","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}