{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T16:10:49Z","timestamp":1786291849007,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451048","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"1516-1526","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Explicit uniquely decodable codes for space bounded channels that achieve list-decoding capacity"],"prefix":"10.1145","author":[{"given":"Ronen","family":"Shaltiel","sequence":"first","affiliation":[{"name":"University of Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jad","family":"Silbak","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"SIAM J. Comput., 35, 1","volume-title":"Some 3CNF properties are hard to test","author":"Ben-Sasson Eli","year":"2005","unstructured":"Eli Ben-Sasson, Prahladh Harsha, and Sofya Raskhodnikova. 2005. Some 3CNF properties are hard to test. SIAM J. Comput., 35, 1, 2005. Pages 1\u201321."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746591"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2245721"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","unstructured":"Stefan Dziembowski Krzysztof Pietrzak and Daniel Wichs. 2018. Non-Malleable Codes. J. ACM 65 4 2018. Pages 20:1\u201320:32. https:\/\/doi.org\/10.1145\/3178432 10.1145\/3178432","DOI":"10.1145\/3178432"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00093"},{"key":"e_1_3_2_1_6_1","unstructured":"G David Forney. 1965. Concatenated codes.."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0147"},{"key":"e_1_3_2_1_8_1","volume-title":"A Sample of Samplers - A Computational Perspective on Sampling (survey). Electronic Colloquium on Computational Complexity (ECCC), 4, 20","author":"Goldreich Oded","year":"1997","unstructured":"Oded Goldreich. 1997. A Sample of Samplers - A Computational Perspective on Sampling (survey). Electronic Colloquium on Computational Complexity (ECCC), 4, 20, 1997."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422494"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855587"},{"key":"e_1_3_2_1_11_1","volume-title":"Optimal rate code constructions for computationally simple channels. Journal of the ACM (JACM), 63, 4","author":"Guruswami Venkatesan","year":"2016","unstructured":"Venkatesan Guruswami and Adam Smith. 2016. Optimal rate code constructions for computationally simple channels. Journal of the ACM (JACM), 63, 4, 2016. Pages 35."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033767"},{"key":"e_1_3_2_1_13_1","series-title":"SIAM J. Comput., 0","volume-title":"Local list recovery of high-rate tensor codes and applications","author":"Hemenway Brett","year":"2019","unstructured":"Brett Hemenway, Noga Ron-Zewi, and Mary Wootters. 2019. Local list recovery of high-rate tensor codes and applications. SIAM J. Comput., 0, 2019. Pages FOCS17\u2013157."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the ACM Symposium on Theory of Computing. Pages 356\u2013364","author":"Impagliazzo R.","unstructured":"R. Impagliazzo, N. Nisan, and A. Wigderson. 1994. Pseudorandomness for network algorithms. In Proceedings of the ACM Symposium on Theory of Computing. Pages 356\u2013364."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9267-y"},{"key":"e_1_3_2_1_16_1","volume-title":"High-rate locally correctable and locally testable codes with sub-polynomial query complexity. Journal of the ACM (JACM), 64, 2","author":"Kopparty Swastik","year":"2017","unstructured":"Swastik Kopparty, Or Meir, Noga Ron-Zewi, and Shubhangi Saraf. 2017. High-rate locally correctable and locally testable codes with sub-polynomial query complexity. Journal of the ACM (JACM), 64, 2, 2017. Pages 11."},{"key":"e_1_3_2_1_17_1","volume-title":"High-rate codes with sublinear-time decoding. Journal of the ACM (JACM), 61, 5","author":"Kopparty Swastik","year":"2014","unstructured":"Swastik Kopparty, Shubhangi Saraf, and Sergey Yekhanin. 2014. High-rate codes with sublinear-time decoding. Journal of the ACM (JACM), 61, 5, 2014. Pages 1\u201320."},{"key":"e_1_3_2_1_18_1","volume-title":"Quasilinear time list-decodable codes for space bounded channels. To appear in the 60th Annual Symposium on Foundations of Computer Science (FOCS)","author":"Kopparty Swastik","year":"2019","unstructured":"Swastik Kopparty, Ronen Shaltiel, and Jad Silbak. 2019. Quasilinear time list-decodable codes for space bounded channels. To appear in the 60th Annual Symposium on Foundations of Computer Science (FOCS), 2019."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.51"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57785-8_183"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2070370"},{"key":"e_1_3_2_1_23_1","volume-title":"Pseudorandom generators for space-bounded computation. Combinatorica, 12, 4","author":"Nisan N.","year":"1992","unstructured":"N. Nisan. 1992. Pseudorandom generators for space-bounded computation. Combinatorica, 12, 4, 1992. Pages 449\u2013461."},{"key":"e_1_3_2_1_24_1","first-page":"1","article-title":"1996. Randomness is Linear","volume":"52","author":"Nisan N.","year":"1996","unstructured":"N. Nisan and D. Zuckerman. 1996. Randomness is Linear in Space. J. Comput. Syst. Sci., 52, 1, 1996. Pages 43\u201352.","journal-title":"Space. J. Comput. Syst. Sci."},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing. Pages 159\u2013168","author":"Raz R.","unstructured":"R. Raz and O. Reingold. 1999. On Recycling the Randomness of States in Space Bounded Computation. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing. Pages 159\u2013168."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","unstructured":"Ronen Shaltiel and Jad Silbak. 2016. Explicit List-Decodable Codes with Optimal Rate for Computationally Bounded Channels. In APPROX\/RANDOM. Pages 45:1\u201345:38. https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2016.45 10.4230\/LIPIcs.APPROX-RANDOM.2016.45","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2016.45"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Ronen Shaltiel and Jad Silbak. 2021. Explicit Uniquely Decodable Codes for Space Bounded Channels That Achieve List-Decoding Capacity.. In Electronic Colloquium on Computational Complexity (ECCC). 27 Pages 47.","DOI":"10.1145\/3406325.3451048"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1283383.1283425"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-003-0237-x"},{"key":"e_1_3_2_1_30_1","volume-title":"A combination of testability and decodability by tensor products. Random Structures & Algorithms, 46, 3","author":"Viderman Michael","year":"2015","unstructured":"Michael Viderman. 2015. A combination of testability and decodability by tensor products. Random Structures & Algorithms, 46, 3, 2015. Pages 572\u2013598."}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451048","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:44Z","timestamp":1750197704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":30,"alternative-id":["10.1145\/3406325.3451048","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451048","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}