{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:52:16Z","timestamp":1773377536171,"version":"3.50.1"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1901410"],"award-info":[{"award-number":["CNS-1901410"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"CNS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517809","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"3002-3007","source":"Crossref","is-referenced-by-count":1,"title":["Irregular Array Codes with Arbitrary Access Sets for Geo-Distributed Storage"],"prefix":"10.1109","author":[{"given":"Francisco","family":"Maturana","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Pittsburgh,PA,USA"}]},{"given":"K. V.","family":"Rashmi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Pittsburgh,PA,USA"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140517"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283534"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5706931"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037161"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2725273"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006645"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2015.2464379"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref2","article-title":"f4: Facebook's warm BLOB storage system","author":"subramanian","year":"2014","journal-title":"11th USENIX Symp Operating Syst Design and Implementation OSDI ‘14"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2518037.2491245"},{"key":"ref20","article-title":"R5X0: an efficient high distance parity-based code with optimal update complexity","volume":"rj 10322","author":"hartline","year":"2004","journal-title":"IBM Research Report"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2568205"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1542275.1542326"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513740"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100218"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.876235"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2013024"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2810095"},{"key":"ref51","author":"jukna","year":"2011","journal-title":"Extremal Combinatorics - With Applications in Computer Science ser Texts in Theoretical Computer Science An EATCS Series"},{"key":"ref52","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8608-5","author":"yeung","year":"2002","journal-title":"A First Course in Information Theory"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023682"},{"key":"ref11","article-title":"Secret-sharing schemes: A survey","author":"beimel","year":"0","journal-title":"Coding and Cryptology - Third International Workshop IWCC 2011"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174012"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2937778"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2336656"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849225"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/12.364531"},{"key":"ref17","article-title":"X-code: MDS array codes with optimal encoding","author":"xu","year":"1999","journal-title":"IEEE Trans Inf Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.485722"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.746771"},{"key":"ref4","article-title":"Giza: erasure coding objects across global data centers","author":"chen","year":"2017","journal-title":"2017 USENIX Annual Technical Conference USENIX ATC 2017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.167"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792237462"},{"key":"ref5","article-title":"Near-optimal latency versus cost tradeoffs in geo-distributed storage","author":"uluyol","year":"2020","journal-title":"17th USENIX Symp Netw Syst Des and Implementation NSDI 2020"},{"key":"ref8","year":"0","journal-title":"Bandwidth pricing details"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00098-4"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262864"},{"key":"ref9","year":"0","journal-title":"Azure storage overview pricing"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref45","article-title":"Optimal locally repairable and secure codes for distributed storage systems","author":"rawat","year":"2013","journal-title":"IEEE Trans Inf Theory"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2715043"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2690662"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517809.pdf?arnumber=9517809","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:17Z","timestamp":1773347657000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517809\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517809","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}