{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:31Z","timestamp":1740131671683,"version":"3.37.3"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1109\/tit.2022.3222736","type":"journal-article","created":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T20:45:18Z","timestamp":1668631518000},"page":"561-574","source":"Crossref","is-referenced-by-count":2,"title":["Storage Codes With Flexible Number of Nodes"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1218-0478","authenticated-orcid":false,"given":"Weiqi","family":"Li","sequence":"first","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3339-3085","authenticated-orcid":false,"given":"Zhiying","family":"Wang","sequence":"additional","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9695-3142","authenticated-orcid":false,"given":"Taiting","family":"Lu","sequence":"additional","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6838-8038","authenticated-orcid":false,"given":"Hamid","family":"Jafarkhani","sequence":"additional","affiliation":[{"name":"Center for Pervasive Communications and Computing (CPCC), University of California at Irvine, Irvine, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1","article-title":"Flexible partial MDS codes","volume-title":"Proc. Non-Volatile Memories Workshop (NVMW)","author":"Li"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1109\/INFOCOM.2014.6848010"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/MASCOT.2008.4770564"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/2093139.2093141"},{"key":"ref5","first-page":"299","article-title":"Screaming fast Galois field arithmetic using Intel SIMD instructions","volume-title":"Proc. FAST","author":"Plank"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/s10958-013-1350-5"},{"key":"ref7","first-page":"253","article-title":"A performance evaluation and examination of open-source erasure coding libraries for storage","volume-title":"Proc. Fast","volume":"9","author":"Plank"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TIT.2019.2917425"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/TIT.2019.2954409"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TIT.2007.899482"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/ISIT.2019.8849451"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1109\/TIT.2016.2616144"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/ITW.2018.8613532"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/TIT.2012.2208937"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TIT.2010.2054295"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1109\/TIT.2013.2252395"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/TIT.2014.2321280"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/LCOMM.2016.2627569"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1109\/TIT.2017.2661313"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/FOCS.2017.28"},{"volume-title":"Cost-efficient repair for storage systems using progressive engagement","year":"2019","author":"Jafarkhani","key":"ref21"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1109\/TIT.2007.911179"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1016\/j.tcs.2011.09.027"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/TIT.2018.2871451"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/TIT.2017.2777490"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/s00145-007-0424-2"},{"key":"ref27","first-page":"269","article-title":"Optimally robust private information retrieval","volume-title":"Proc. 21st USENIX Secur. Symp. (USENIX Secur.)","author":"Devet"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1109\/ISIT.2017.8006860"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1109\/ISIT.2018.8437670"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1109\/TIT.2017.2736066"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1109\/ISIT44484.2020.9174030"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/ISIT.2019.8849212"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/ISIT44484.2020.9174275"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.3390\/e22050544"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/TCOMM.2021.3056089"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1137\/0108018"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/18.485722"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1016\/j.disc.2014.01.016"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1109\/TIT.2014.2332338"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1109\/LCOMM.2017.2675905"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/TIT.2022.3166210"},{"doi-asserted-by":"publisher","key":"ref42","DOI":"10.1109\/TIT.2011.2159049"},{"doi-asserted-by":"publisher","key":"ref43","DOI":"10.1109\/TIT.2013.2241819"},{"doi-asserted-by":"publisher","key":"ref44","DOI":"10.1109\/TIT.2012.2227110"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1109\/TIT.2016.2553675"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1109\/ITA.2016.7888191"},{"doi-asserted-by":"publisher","key":"ref47","DOI":"10.1109\/TIT.2017.2690662"},{"doi-asserted-by":"publisher","key":"ref48","DOI":"10.1109\/TIT.2017.2730863"},{"doi-asserted-by":"publisher","key":"ref49","DOI":"10.1109\/TIT.2017.2702660"},{"doi-asserted-by":"publisher","key":"ref50","DOI":"10.1109\/TIT.2018.2827942"},{"doi-asserted-by":"publisher","key":"ref51","DOI":"10.1109\/TIT.2018.2884075"},{"doi-asserted-by":"publisher","key":"ref52","DOI":"10.1109\/TIT.2020.3023110"},{"doi-asserted-by":"publisher","key":"ref53","DOI":"10.1017\/CBO9781139172769"},{"doi-asserted-by":"publisher","key":"ref54","DOI":"10.1109\/2.268881"},{"doi-asserted-by":"publisher","key":"ref55","DOI":"10.1016\/j.stamet.2008.04.001"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9997158\/09953740.pdf?arnumber=9953740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T03:25:02Z","timestamp":1706757902000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9953740\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1]]},"references-count":55,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3222736","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2023,1]]}}}