{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:13Z","timestamp":1773377773951,"version":"3.50.1"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834854","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2625-2630","source":"Crossref","is-referenced-by-count":1,"title":["A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It"],"prefix":"10.1109","author":[{"given":"Han","family":"Cai","sequence":"first","affiliation":[{"name":"Southwest Jiaotong University,School of Information Science and Technology,Chengdu,China,610031"}]},{"given":"Moshe","family":"Schwartz","sequence":"additional","affiliation":[{"name":"Ben-Gurion University of the Negev,School of Electrical and Computer Engineering,Beer Sheva,Israel,8410501"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140521"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3043759"},{"key":"ref37","article-title":"Construction of optimal locally recoverable codes and connection with hypergraph","author":"xing","year":"2019","journal-title":"46th International Colloquium on Automata Languages and Programming (ICALP 2019)"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598149"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2472515"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1504\/IJICOT.2016.079496"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834854"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3036279"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2761120"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174243"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref17","article-title":"Improved maximally recoverable LRCs using skew polynomials","author":"gopi","year":"2020","journal-title":"2012 arXiv preprint arXiv"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2990981"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2988459"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2560013"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3161613"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2942304"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120016"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977647"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3037268"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800042"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2891765"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref24","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2901492"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(87)80018-5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834854.pdf?arnumber=9834854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:07Z","timestamp":1773347707000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834854\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834854","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}