{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:51:49Z","timestamp":1755219109229,"version":"3.43.0"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"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":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437936","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T16:14:55Z","timestamp":1534522495000},"page":"1331-1335","source":"Crossref","is-referenced-by-count":3,"title":["List Decoding of Locally Repairable Codes"],"prefix":"10.1109","author":[{"given":"Lukas","family":"Holzbaur","sequence":"first","affiliation":[{"name":"Technical University of Munich, Insitute for Communications Engineering, Germany"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Insitute for Communications Engineering, Germany"}]}],"member":"263","reference":[{"key":"ref10","article-title":"List decoding Reed-Solomon, algebraic-geometric, and Gabidulin subcodes up to the Singleton bound","author":"guruswami","year":"2012","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057212"},{"key":"ref12","first-page":"163","article-title":"The undetected error probability for Reed-Solomon codes","volume":"1","author":"cheung","year":"1988","journal-title":"Proc Military Commun Conf"},{"key":"ref13","article-title":"The Guruswami-Sudan decoding algorithm for Reed-Solomon codes","volume":"42?153","author":"mceliece","year":"2003","journal-title":"IPN Progress Report"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620540"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057714"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"ref2","first-page":"1606","article-title":"Codes with local regeneration","author":"kamath","year":"2013","journal-title":"IEEE Int Symp Inf Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/0400000007"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437936.pdf?arnumber=8437936","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T17:56:10Z","timestamp":1754502970000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437936\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437936","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}