{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:29:17Z","timestamp":1757312957186,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437455","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1196-1200","source":"Crossref","is-referenced-by-count":4,"title":["Codes with Combined Locality and Regeneration Having Optimal Rate, <tex>$d_{\\min}$<\/tex> and Linear Field Size"],"prefix":"10.1109","author":[{"given":"M. Nikhil","family":"Krishnan","sequence":"first","affiliation":[]},{"given":"Anantha","family":"Narayanan R","sequence":"additional","affiliation":[]},{"given":"P. Vijay","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref11","article-title":"Enabling All-Node-Repair in Minimum Storage Regenerating Codes","volume":"abs 1604 7671","author":"li","year":"2016","journal-title":"CoRR"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2730863"},{"key":"ref13","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":"ref14","first-page":"1623","article-title":"A generic transformation for optimal repair bandwidth and rebuilding access in MDS codes","author":"tian","year":"2017","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref15","article-title":"Codes with Combined Locality and Regeneration Having Optimal Rate, dmin and Linear Field Size","volume":"abs 1804 564","author":"krishnan","year":"2018","journal-title":"CoRR"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref6","article-title":"Locally Repairable and Locally Regenerating Codes Obtained by Parity-Splitting of HashTag Codes","volume":"abs 1701 6664","author":"gligoroski","year":"2017","journal-title":"CoRR"},{"key":"ref5","article-title":"Optimal Locally Repairable and Secure Codes for Distributed Storage Systems","volume":"abs 1210 6954","author":"rawat","year":"2012","journal-title":"CoRR"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173792"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2809003"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2159049"}],"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\/08437455.pdf?arnumber=8437455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T00:09:08Z","timestamp":1598227748000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437455\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437455","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}