{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:25Z","timestamp":1773376705391,"version":"3.50.1"},"reference-count":21,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206908","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1142-1147","source":"Crossref","is-referenced-by-count":7,"title":["Low-access repair of Reed-Solomon codes in rack-aware storage"],"prefix":"10.1109","author":[{"given":"Jiaojiao","family":"Wang","sequence":"first","affiliation":[{"name":"Tsinghua-Berkeley Shenzhen Institute, Tsinghua Shenzhen International Graduate School,Data Science and Information Technology Research Center,Shenzhen,China"}]},{"given":"Zitan","family":"Chen","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong,School of Science and Engineering, the Guangdong Provincial Key Laboratory of Future Networks of Intelligence,Shenzhen,China"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3175826"},{"key":"ref12","first-page":"264","article-title":"Rack-aware cooperative regenerating codes","author":"gupta","year":"2020","journal-title":"2020 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965891"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611399"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3017666"},{"key":"ref11","article-title":"Rack-aware MSR codes with multiple erasure tolerance","author":"wang","year":"2021"},{"key":"ref10","article-title":"Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model","author":"jin","year":"2019"},{"key":"ref21","article-title":"Rack-aware minimum-storage regenerating codes with optimal access","author":"wang","year":"2023"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902835"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541298"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250458"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2972899"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006547"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2702660"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884075"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2941744"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2871451"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206908.pdf?arnumber=10206908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:48Z","timestamp":1773347268000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206908\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206908","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}