{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:46:02Z","timestamp":1730274362122,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437512","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"2376-2380","source":"Crossref","is-referenced-by-count":6,"title":["Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for <tex>$d=k+1, k+2, k+3$<\/tex>"],"prefix":"10.1109","author":[{"given":"Myna","family":"Vajha","sequence":"first","affiliation":[]},{"given":"Balaji Srinivasan","family":"Babu","sequence":"additional","affiliation":[]},{"given":"P. Vijay","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref11","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","volume":"abs 1607 7335","author":"sasidharan","year":"2016","journal-title":"CoRR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006804"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2690662"},{"journal-title":"Explicit msr codes with optimal access optimal sub-packetization and small field size for d = k+ 1 k+ 2 k + 3","year":"2018","author":"vajha","key":"ref16"},{"journal-title":"Matlab code the MSR Construction","year":"0","key":"ref17"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref6","first-page":"1374","article-title":"On Codes for Optimal Rebuilding Access","author":"wang","year":"2009","journal-title":"Proc IEEE 47th Annual Allerton Conference on Communication Control and Computing"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283042"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref1","article-title":"A tight lower bound on the sub-packetization level of optimal-access MSR and MDS codes","volume":"abs 1710 5876","author":"balaji","year":"2017","journal-title":"CoRR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437512.pdf?arnumber=8437512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:26:03Z","timestamp":1598221563000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437512\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437512","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}