{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:47Z","timestamp":1773376787878,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206554","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1753-1757","source":"Crossref","is-referenced-by-count":2,"title":["A construction of Maximally Recoverable LRCs for small number of local groups"],"prefix":"10.1109","author":[{"given":"Manik","family":"Dhar","sequence":"first","affiliation":[{"name":"Princeton University,Department of Computer Science"}]},{"given":"Sivakanth","family":"Gopi","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2988459"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/20M1386001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref20","author":"gabidulin","year":"2021","journal-title":"Rank Codes"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-022-01020-8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref1","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"ref16","article-title":"Maximally Recoverable Local Repairable Codes from Subspace Direct Sum Systems","author":"liu","year":"2022","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523717"},{"key":"ref18","first-page":"1876","author":"chen","year":"2015","journal-title":"Sector-disk codes and partial MDS codes with up to three global parities"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176807"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206554.pdf?arnumber=10206554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:20Z","timestamp":1773347300000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206554\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206554","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}