{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T07:33:26Z","timestamp":1763105606137,"version":"3.28.0"},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437486","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"2381-2385","source":"Crossref","is-referenced-by-count":32,"title":["A Tight Lower Bound on the Sub- Packetization Level of Optimal-Access MSR and MDS Codes"],"prefix":"10.1109","author":[{"given":"S. B.","family":"Balaji","sequence":"first","affiliation":[]},{"given":"P. Vijay","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref3","article-title":"Improved upper bounds on systematic-length for linear minimum storage regenerating codes","volume":"abs 1610 8026","author":"huang","year":"2016","journal-title":"CoRR"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006804"},{"key":"ref5","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":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2178588"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2016.7888191"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309000"},{"key":"ref9","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":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2305698"}],"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\/08437486.pdf?arnumber=8437486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:09:46Z","timestamp":1598242186000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437486\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437486","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}