{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T05:29:43Z","timestamp":1745558983841},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/tcomm.2018.2836445","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T20:50:58Z","timestamp":1526417458000},"page":"1-1","source":"Crossref","is-referenced-by-count":8,"title":["Explicit Constructions of High-Rate MSR Codes with Optimal Access Property over Small Finite Fields"],"prefix":"10.1109","author":[{"given":"Yi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jie","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiaohu","family":"Tang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2590429"},{"key":"ref13","first-page":"1289","article-title":"A new construction of \n$(k+2,k)$\n minimal storage regenerating code over F3 with optimal access property for all nodes","volume":"20","author":"li","year":"2016","journal-title":"IEEE Commun Lett"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2408600"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006804"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/4236.957894"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2553675"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref4","first-page":"1","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Annual Technical Conf 2012"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2424416"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140520"},{"key":"ref2","first-page":"7","article-title":"Designing a DHT for low latency and high throughput","author":"dabek","year":"2004","journal-title":"Proc 1st Symp Netw Syst Des Implement (NSDI)"},{"key":"ref1","first-page":"25","article-title":"Total recall: System support for automated availability management","author":"bhagwan","year":"2004","journal-title":"Proc 1st Symp Netw Syst Des Implement (NSDI)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref22","author":"sasidharan","year":"2016","journal-title":"An explicit coupled-layer construction of a high-rate MSR code with low sub-packetization level small field size and all-node repair"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2658660"},{"key":"ref23","author":"balaji","year":"2017","journal-title":"A tight lower bound on the subpacketization level of optimal-access MSR and MDS codes"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/5497975\/08359405.pdf?arnumber=8359405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T22:05:23Z","timestamp":1643234723000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8359405\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/tcomm.2018.2836445","relation":{},"ISSN":["0090-6778"],"issn-type":[{"value":"0090-6778","type":"print"}],"subject":[],"published":{"date-parts":[[2018]]}}}