{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:11Z","timestamp":1772283491034,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8006511","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"166-170","source":"Crossref","is-referenced-by-count":16,"title":["Rate optimal binary linear locally repairable codes with small availability"],"prefix":"10.1109","author":[{"given":"Swanand","family":"Kadhe","sequence":"first","affiliation":[]},{"given":"Robert","family":"Calderbank","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874919"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874921"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282779"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2605119"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref16","author":"balaji","year":"2016","journal-title":"Bounds on codes with locality and availability"},{"key":"ref17","first-page":"299","article-title":"Screaming fast galois field arithmetic using intel simd instructions","author":"plank","year":"2013","journal-title":"Proceedings of the 11th USENIX Conference on File and Storage Technologies"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057043"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006511"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557599"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref1","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proceedings of the 2012 USENIX Conference on Annual Technical Conference"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875176"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"ref21","author":"kuijper","year":"2014","journal-title":"Erasure codes with simplex locality"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133123"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079496"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/BF02759743"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","location":"Aachen, Germany","start":{"date-parts":[[2017,6,25]]},"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\/08006511.pdf?arnumber=8006511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,3]],"date-time":"2017-10-03T02:18:33Z","timestamp":1506997113000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8006511\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8006511","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}