{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:34Z","timestamp":1725664414126},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262862","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T18:03:47Z","timestamp":1516298627000},"page":"1115-1122","source":"Crossref","is-referenced-by-count":3,"title":["Maximally recoverable codes: The bounded case"],"prefix":"10.1109","author":[{"given":"Venkata","family":"Gandikota","sequence":"first","affiliation":[]},{"given":"Elena","family":"Grigorescu","sequence":"additional","affiliation":[]},{"given":"Clayton","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"Minshen","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"2092","article-title":"Maximally recoverable codes for grid-like topologies","author":"gopalan","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref13","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"USENIX Annual Technical Conference"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007396"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.31"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447093"},{"journal-title":"Finite Fields","year":"1986","author":"lidl","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282782"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"journal-title":"Batch codes through dense graphs without short cycles","year":"2014","author":"dimakis","key":"ref6"},{"journal-title":"Personal communication","year":"2017","author":"yekhanin","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282977"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"journal-title":"Pir array codes with optimal PIR rate","year":"2016","author":"blackburn","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9658-6"},{"key":"ref20","first-page":"299","article-title":"Screaming fast galois field arithmetic using intel SIMD instructions","author":"plank","year":"2013","journal-title":"FAST"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874921"},{"key":"ref23","first-page":"383","article-title":"f4: Facebook's warm BLOB storage system","author":"subramanian","year":"2014","journal-title":"OSDI"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262862.pdf?arnumber=8262862","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T16:34:35Z","timestamp":1519835675000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262862\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262862","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}