{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T21:32:40Z","timestamp":1768426360881,"version":"3.49.0"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1617884"],"award-info":[{"award-number":["CCF-1617884"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1109\/tit.2020.3033338","type":"journal-article","created":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T19:51:15Z","timestamp":1603482675000},"page":"7490-7527","source":"Crossref","is-referenced-by-count":22,"title":["Cascade Codes for Distributed Storage Systems"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8743-9969","authenticated-orcid":false,"given":"Mehran","family":"Elyasi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2254-1652","authenticated-orcid":false,"given":"Soheil","family":"Mohajer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447097"},{"key":"ref38","article-title":"Shortened regenerating codes","author":"duursma","year":"2015","journal-title":"arXiv 1505 00178"},{"key":"ref33","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":"arXiv 1607 07335"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437320"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2855059"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282577"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282818"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2408595"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437486"},{"key":"ref29","article-title":"Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes","author":"singh rawat","year":"2016","journal-title":"arXiv 1601 06362"},{"key":"ref2","volume":"37","author":"ghemawat","year":"2003","journal-title":"The Google File System"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437696"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2658660"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2408600"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2590429"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2878223"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2796599"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1049\/el.2016.0189"},{"key":"ref58","author":"oppenheim","year":"1996","journal-title":"Signals and Systems"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2191388"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2120210"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797595"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2105003"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437458"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2837860"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100217"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616137"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140516"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.641556"},{"key":"ref15","article-title":"Distributed data storage with minimum storage regenerating codes–exact and functional repair are asymptotically equally efficient","author":"cadambe","year":"2010","journal-title":"arXiv 1004 4299"},{"key":"ref16","article-title":"On the existence of optimal exact-repair MDS codes for distributed storage","author":"suh","year":"2010","journal-title":"arxiv 1004 4663"},{"key":"ref17","article-title":"Searching for minimum storage regenerating codes","author":"cullina","year":"2009","journal-title":"arXiv 0910 2245"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1109\/TIT.2014.2378255","article-title":"A unified form of exact-MSR codes via product-matrix frameworks","volume":"61","author":"lin","year":"2015","journal-title":"IEEE Trans Inf Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2690662"},{"key":"ref4","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"USENIX Annu Tech Conf"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/4236.957894"},{"key":"ref5","first-page":"85","article-title":"Designing a DHT for low latency and high throughput","volume":"4","author":"dabek","year":"2004","journal-title":"Proc NSDI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref7","first-page":"25","article-title":"Total recall: System support for automated availability management","volume":"4","author":"bhagwan","year":"2004","journal-title":"Proc NSDI"},{"key":"ref49","author":"tian","year":"2018","journal-title":"SCITL Solutions of Computed Information-Theoretic Limits"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref46","author":"horn","year":"1990","journal-title":"Matrix Analysis"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262838"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.2307\/2001955"},{"key":"ref42","first-page":"1036","article-title":"New codes and inner bounds for exact repair in distributed storage systems","author":"goparaju","year":"2014","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904294"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2017.7997027"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133121"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9266290\/9238032-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9266290\/09238032.pdf?arnumber=9238032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:22:44Z","timestamp":1651080164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9238032\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":59,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3033338","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]}}}