{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:43:37Z","timestamp":1773377017264,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195413","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A Multi-Node Repair Scheme of Reed-Solomon Codes"],"prefix":"10.1109","author":[{"given":"Yumeng","family":"Yang","sequence":"first","affiliation":[{"name":"Southwest Jiaotong University,Information Security and National Computing Grid Laboratory,Chengdu,China"}]},{"given":"Han","family":"Cai","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University,Information Security and National Computing Grid Laboratory,Chengdu,China"}]},{"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[{"name":"Southwest Jiaotong University,Information Security and National Computing Grid Laboratory,Chengdu,China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3177903"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3071447"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006547"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2827942"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3071878"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2702660"},{"key":"ref7","article-title":"Optimal repairing schemes for ReedSolomon codes with alphabet sizes linear in lengths under the rack-aware model","author":"Jin","year":"2019","journal-title":"Arxiv"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-025-01679-9"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2917425"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876542"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2884075"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3347654"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541489"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISCIT.2019.8905159"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195413.pdf?arnumber=11195413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:03Z","timestamp":1773347403000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195413\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195413","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}