{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:15:43Z","timestamp":1775913343903,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Guangdong Provincial Key Laboratory of Future Network of Intelligence","award":["2022B1212010001"],"award-info":[{"award-number":["2022B1212010001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12141108"],"award-info":[{"award-number":["12141108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62201487"],"award-info":[{"award-number":["62201487"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Science and Technology Stable Support Program"},{"DOI":"10.13039\/501100017610","name":"Shenzhen Science and Technology Innovation Program","doi-asserted-by":"publisher","award":["RCBS20221008093108032"],"award-info":[{"award-number":["RCBS20221008093108032"]}],"id":[{"id":"10.13039\/501100017610","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/tcomm.2025.3631550","type":"journal-article","created":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T18:27:32Z","timestamp":1762885652000},"page":"957-970","source":"Crossref","is-referenced-by-count":1,"title":["Rack-Aware Minimum-Storage Regenerating Codes With Optimal Access"],"prefix":"10.1109","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4782-5492","authenticated-orcid":false,"given":"Jiaojiao","family":"Wang","sequence":"first","affiliation":[{"name":"Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen, Guangdong, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0570-0770","authenticated-orcid":false,"given":"Zitan","family":"Chen","sequence":"additional","affiliation":[{"name":"School of Science and Engineering, Future Networks of Intelligence Institute, The Chinese University of Hong Kong (Shenzhen), Shenzhen, Guangdong, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW54588.2022.9965891"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206908"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICICS.2015.7459908"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2871451"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274265"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISNETCOD.2011.5978920"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847953"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2856206"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref14","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":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2855059"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3033338"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/20M1346742"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2010.07.022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2013.72"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620424"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2837860"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541298"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970791"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437639"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2806342"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033777"},{"key":"ref27","first-page":"368","article-title":"Distributed storage over unidirectional ring networks","volume-title":"Proc. Int. Symp. Inf. Theory Appl.","author":"Lu"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3145824"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2902835"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3149349"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2941744"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174461"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ITW46852.2021.9457648"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2020.2972899"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3250458"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3432822"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611399"},{"key":"ref40","first-page":"264","article-title":"Rack-aware cooperative regenerating codes","volume-title":"Proc. Int. Symp. Inf. Theory Appl. (ISITA)","author":"Gupta"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3175826"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3289187"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3402624"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2015-02925-1"},{"key":"ref45","article-title":"Rack-aware minimum-storage regenerating codes with optimal access","author":"Wang","year":"2023","journal-title":"arXiv:2304.08747"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/26\/11320979\/11240156.pdf?arnumber=11240156","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T07:12:11Z","timestamp":1768374731000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11240156\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/tcomm.2025.3631550","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}