{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T18:57:41Z","timestamp":1769281061606,"version":"3.49.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"J. C. Bose National Fellowship","award":["JCB\/2017\/000017"],"award-info":[{"award-number":["JCB\/2017\/000017"]}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["CRG\/2021\/008479"],"award-info":[{"award-number":["CRG\/2021\/008479"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/tit.2022.3180034","type":"journal-article","created":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T19:47:13Z","timestamp":1654285633000},"page":"6452-6471","source":"Crossref","is-referenced-by-count":10,"title":["Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0068-9712","authenticated-orcid":false,"given":"S. B.","family":"Balaji","sequence":"first","affiliation":[{"name":"Qualcomm, Bangalore, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7770-2583","authenticated-orcid":false,"given":"Myna","family":"Vajha","sequence":"additional","affiliation":[{"name":"Qualcomm, Bangalore, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0990-2847","authenticated-orcid":false,"given":"P.","family":"Vijay Kumar","sequence":"additional","affiliation":[{"name":"Department of Electrical Communication Engineering, IISc Bengaluru, Bengaluru, India"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437486"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437512"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282816"},{"key":"ref4","first-page":"1","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.07335","author":"Sasidharan","year":"2016","journal-title":"CoRR"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref9","first-page":"139","article-title":"Clay codes: Moulding MDS codes to yield an MSR code","volume-title":"Proc. 16th USENIX Conf. File Storage Technol.","author":"Vajha"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10958-013-1350-5"},{"key":"ref11","volume-title":"Intel Intelligent Storage Acceleration Library","year":"2022"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-018-9482-6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2241819"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227110"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2011.6120327"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2590429"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237752"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2015.7084873"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2855059"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2880239"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316387"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3112286"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9893495\/09787510.pdf?arnumber=9787510","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:33:12Z","timestamp":1706754792000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9787510\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":27,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3180034","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}