{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:06:19Z","timestamp":1750694779065,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ISF grant","award":["No. 1030\/15"],"award-info":[{"award-number":["No. 1030\/15"]}]},{"name":"NSF-BSF grant","award":["No. 2015814"],"award-info":[{"award-number":["No. 2015814"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384295","type":"proceedings-article","created":{"date-parts":[[2021,6,28]],"date-time":"2021-06-28T21:48:11Z","timestamp":1624916891000},"page":"538-551","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Combinatorial list-decoding of Reed-Solomon codes beyond the Johnson radius"],"prefix":"10.1145","author":[{"given":"Chong","family":"Shangguan","sequence":"first","affiliation":[{"name":"Tel Aviv University, Israel"}]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.2307\/3212384"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90022-6"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034780"},{"key":"e_1_3_2_1_4_1","unstructured":"Volodia M. Blinovski \u02d8\u0131. 1986. Bounds for codes in decoding by a list of finite length. Problemy Peredachi Informatsii 22 1 ( 1986 ) 11-25.  Volodia M. Blinovski \u02d8\u0131. 1986. Bounds for codes in decoding by a list of finite length. Problemy Peredachi Informatsii 22 1 ( 1986 ) 11-25."},{"volume-title":"Asymptotic Combinatorial Coding Theory","author":"Blinovsky Volodia M.","key":"e_1_3_2_1_5_1","unstructured":"Volodia M. Blinovsky . 1997. Asymptotic Combinatorial Coding Theory . Kluwer Academic Publishers , Norwell, MA, USA . Volodia M. Blinovsky. 1997. Asymptotic Combinatorial Coding Theory. Kluwer Academic Publishers, Norwell, MA, USA."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447335"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/120896773"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3"},{"key":"e_1_3_2_1_9_1","volume-title":"Wescon Convention Record, Part 2, Institute of Radio Engineers ( 1957 ), 99-104","author":"Elias Peter","year":"1957","unstructured":"Peter Elias . 1957 . List decoding for noisy channels . Wescon Convention Record, Part 2, Institute of Radio Engineers ( 1957 ), 99-104 . Peter Elias. 1957. List decoding for noisy channels. Wescon Convention Record, Part 2, Institute of Radio Engineers ( 1957 ), 99-104."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095170"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.995539"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878164"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_1_16_1","volume-title":"Essential coding theory. Retrieved","author":"Guruswami Venkatesan","year":"2019","unstructured":"Venkatesan Guruswami , Atri. Rudra, and Madhu Sudan . 2019. Essential coding theory. Retrieved October 1, 2019 from http:\/\/www.cse.bufalo.edu\/~atri\/courses\/ coding-theory\/book Venkatesan Guruswami, Atri. Rudra, and Madhu Sudan. 2019. Essential coding theory. Retrieved October 1, 2019 from http:\/\/www.cse.bufalo.edu\/~atri\/courses\/ coding-theory\/book"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782097"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214009"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a005"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00029"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_26_1","unstructured":"Johan Rosenkilde. Aug. 2019. Personal Communication (Aug. 2019 ).  Johan Rosenkilde. Aug. 2019. Personal Communication (Aug. 2019 )."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1964.1053661"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/346048.346049"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000010"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488716"},{"key":"e_1_3_2_1_34_1","first-page":"90","volume-title":"Research Laboratory of Electronics, MIT 48 ( 1958 )","author":"Wozencraft John M.","unstructured":"John M. Wozencraft . 1958. List Decoding . Quarterly Progress Report , Research Laboratory of Electronics, MIT 48 ( 1958 ) , 90 - 95 . John M. Wozencraft. 1958. List Decoding. Quarterly Progress Report, Research Laboratory of Electronics, MIT 48 ( 1958 ), 90-95."}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Chicago IL USA","acronym":"STOC '20"},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384295","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":33,"alternative-id":["10.1145\/3357713.3384295","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384295","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}