{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T17:35:27Z","timestamp":1789752927404,"version":"4.0.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFA1005000"],"award-info":[{"award-number":["2022YFA1005000"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62271421"],"award-info":[{"award-number":["62271421"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"German Israeli Project Cooperation [Deutsch-Israelische Projektkooperation (DIP)]","award":["PE2398\/1-1"],"award-info":[{"award-number":["PE2398\/1-1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/tit.2022.3225953","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T20:50:36Z","timestamp":1669927836000},"page":"2240-2260","source":"Crossref","is-referenced-by-count":7,"title":["A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8476-1303","authenticated-orcid":false,"given":"Han","family":"Cai","sequence":"first","affiliation":[{"name":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1449-0026","authenticated-orcid":false,"given":"Moshe","family":"Schwartz","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800042"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2869800"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3161613"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2944397"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3037268"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036279"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174243"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176807"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2988459"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2539160"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2901492"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2834942"},{"key":"ref27","volume-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(87)80018-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2560013"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2942304"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3043759"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282657"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079496"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472515"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598149"},{"key":"ref43","first-page":"1","article-title":"Construction of optimal locally recoverable codes and connection with hypergraph","volume-title":"Proc. 46th Int. Colloq. Automata, Lang., Program. (ICALP)","author":"Xing"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541377"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10073961\/09967841.pdf?arnumber=9967841","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T02:50:31Z","timestamp":1706755831000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9967841\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":44,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3225953","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}