{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:28Z","timestamp":1740131668670,"version":"3.37.3"},"reference-count":85,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001659","name":"German Research Foundation [Deutsche Forschungsgemeinschaft (DFG)]","doi-asserted-by":"publisher","award":["WA3907\/1-1"],"award-info":[{"award-number":["WA3907\/1-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"European Union\u2019s Horizon 2020 Research and Innovation Program under the Marie Sklodowska-Curie","award":["713683"],"award-info":[{"award-number":["713683"]}]},{"name":"German Israeli Project Cooperation","award":["KR3517\/9-1"],"award-info":[{"award-number":["KR3517\/9-1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/tit.2020.3041475","type":"journal-article","created":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T22:55:38Z","timestamp":1606863338000},"page":"1571-1595","source":"Crossref","is-referenced-by-count":1,"title":["Error Decoding of Locally Repairable and Partial MDS Codes"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8048-3051","authenticated-orcid":false,"given":"Lukas","family":"Holzbaur","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7474-2678","authenticated-orcid":false,"given":"Sven","family":"Puchinger","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5174-1947","authenticated-orcid":false,"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2008.07.004"},{"article-title":"Public key cryptography based on coding theory","year":"2007","author":"overbeck","key":"ref72"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089384"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874918"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541565"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/18.133259"},{"key":"ref74","article-title":"Weight and rank of matrices over finite fields","author":"migler","year":"2004","journal-title":"arXiv math\/0403314"},{"key":"ref39","article-title":"The Guruswami-Sudan decoding algorithm for Reed–Solomon codes","volume":"42","author":"mceliece","year":"2003","journal-title":"IPN Progress Rep"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.2140\/obs.2019.2.293"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057212"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.815776"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/18.340487"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.490540"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref31","first-page":"41","article-title":"New upper bounds for error correcting codes","volume":"1","author":"bassalygo","year":"1965","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.32169"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.1988.13385"},{"key":"ref35","article-title":"List decoding Reed–Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound","author":"guruswami","year":"2012","journal-title":"Electron Colloq Comput Complex"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.817522"},{"key":"ref60","first-page":"1755","article-title":"Multivariate interpolation decoding beyond the Guruswami–Sudan radius","author":"parvaresh","year":"2004","journal-title":"Proc Allerton Conf Commun Control Comput"},{"article-title":"Algebraic list-decoding of error-correcting codes","year":"2007","author":"parvaresh","key":"ref62"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365363"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557409"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref64","doi-asserted-by":"crossref","first-page":"271","DOI":"10.2140\/obs.2013.1.271","article-title":"Approximate common divisors via lattices","volume":"1","author":"cohn","year":"2013","journal-title":"Open Book Series"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513354"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620353"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9728-9"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006549"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2868701"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1561\/0400000007"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989391"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437936"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2890201"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2627569"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2536720"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2310479"},{"key":"ref23","article-title":"A complete classification of partial-MDS (maximally recoverable) codes with one global parity","author":"horlemann-trautmann","year":"2017","journal-title":"arXiv 1707 00847"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195641"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162191"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021308"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2060130"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780563"},{"key":"ref58","first-page":"97","article-title":"Decoding of interleaved Reed–Solomon codes over noisy data","author":"bleichenbacher","year":"2003","journal-title":"Proc Int Colloq Automata Lang Program"},{"key":"ref57","first-page":"1","article-title":"Decoding punctured Reed–Solomon codes up to the singleton bound","author":"sidorenko","year":"2008","journal-title":"Proc Int ITG Conf Source Channel Coding"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849600"},{"key":"ref55","article-title":"A public-key cryptosystem from interleaved Goppa codes","author":"elleuch","year":"2018","journal-title":"arXiv 1809 03024"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0577-z"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2018005"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9625-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.14778\/2535573.2488339"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2329872"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2480848"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557272"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2332338"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/18.761280"},{"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":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8278028"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2924888"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875176"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2252395"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/18.476213"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2096170"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054295"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006678"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283046"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447093"},{"key":"ref8","first-page":"2","article-title":"Erasure coding in windows azure storage","author":"huang","year":"2012","journal-title":"Proc USENIX Conf Annu Tech Conf"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/NCA.2007.37"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2005.1531885"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708636"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/20.617715"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365365"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/18.796374"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/18.53757"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9356438\/09274335.pdf?arnumber=9274335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:27Z","timestamp":1652194467000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9274335\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":85,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2020.3041475","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}