{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:34:52Z","timestamp":1774679692492,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF CAREER Award","award":["1451191"],"award-info":[{"award-number":["1451191"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1523816"],"award-info":[{"award-number":["CCF-1523816"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1563742"],"award-info":[{"award-number":["CCF-1563742"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1109\/tit.2020.2990981","type":"journal-article","created":{"date-parts":[[2020,4,28]],"date-time":"2020-04-28T20:31:55Z","timestamp":1588105915000},"page":"6066-6083","source":"Crossref","is-referenced-by-count":29,"title":["Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities"],"prefix":"10.1109","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9706-4171","authenticated-orcid":false,"given":"Sivakanth","family":"Gopi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7926-3396","authenticated-orcid":false,"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[]},{"given":"Sergey","family":"Yekhanin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"A nearly tight upper bound on tri-colored sum-free sets in characteristic 2","author":"kleinberg","year":"2016","journal-title":"arXiv 1605 08416"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/jdw010"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897525"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661313"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2633411"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1953-027-0"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-011-0061-1"},{"key":"ref35","article-title":"Personal communication","author":"gopalan","year":"2017"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09494-6"},{"key":"ref11","first-page":"299","article-title":"Screaming fast Galois field arithmetic using Intel SIMD instructions","author":"plank","year":"2013","journal-title":"Proc 11th USENIX Conf File Storage Technol (FAST)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.4171\/JEMS\/316"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541567"},{"key":"ref17","first-page":"2092","article-title":"Maximally recoverable codes for grid-like topologies","author":"gopalan","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006478"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2700859"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref3","author":"macwilliams","year":"1977","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref29","first-page":"33","article-title":"Labeling the complete bipartite graph with no zero cycles","author":"kane","year":"2017","journal-title":"Proc IEEE Symp Foundations Comput Sci (FOCS)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref8","article-title":"Construction of PMDS and SD codes extending RAID 5","author":"blaum","year":"2013","journal-title":"arXiv 1305 0032"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref1","first-page":"15","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Annu Tech Conf (ATC)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref22","article-title":"Constructions of maximally recoverable local reconstruction codes via function fields","author":"guruswami","year":"2018","journal-title":"arXiv 1808 04539"},{"key":"ref21","article-title":"Random construction of partial MDS codes","author":"neri","year":"2018","journal-title":"arXiv 1801 05848"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.01.016"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00027"},{"key":"ref41","author":"menezes","year":"2013","journal-title":"Applications of Finite Fields"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525926"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.32.12.331"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/BF02399204"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613535"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9201197\/9080118-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9201197\/09080118.pdf?arnumber=9080118","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T17:26:14Z","timestamp":1651080374000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9080118\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":43,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.2990981","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10]]}}}