{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:07Z","timestamp":1773377047947,"version":"3.50.1"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195274","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes"],"prefix":"10.1109","author":[{"given":"Jonathan","family":"Mosheiff","sequence":"first","affiliation":[{"name":"Ben-Gurion University,Department of Computer Science,Beersheba,Israel"}]},{"given":"Nicolas","family":"Resch","sequence":"additional","affiliation":[{"name":"Informatics Institute, University of Amsterdam,Amsterdam,The Netherlands"}]},{"given":"Kuo","family":"Shang","sequence":"additional","affiliation":[{"name":"Ben-Gurion University,Department of Computer Science,Beersheba,Israel"}]},{"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[{"name":"Ben-Gurion University,Department of Computer Science,Beersheba,Israel"}]}],"member":"263","reference":[{"key":"ref1","first-page":"94","article-title":"List decoding for noisy channels","author":"Elias","year":"1957","journal-title":"Wescon Convention Record"},{"key":"ref2","first-page":"90","article-title":"List decoding","volume":"48","author":"Wozencraft","year":"1958","journal-title":"Quarter Progress Report"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451046"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055408"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00048"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451126"},{"issue":"4","key":"ref9","first-page":"29","article-title":"List concatenated decoding","volume":"17","author":"Zyablov","year":"1981","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.995539"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2010.2095170"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.31"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488716"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.42"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.3041650"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127126"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649634"},{"key":"ref19","article-title":"Local properties of reed-solomon codes and random linear codes","author":"Levi","year":"2024","journal-title":"arXiv preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/focs46700.2020.00050"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00011"},{"key":"ref22","article-title":"Pseudorandom linear codes are list-decodable to capacity","volume-title":"15th Innovations in Theoretical Computer Science Conference (ITCS 2024)","author":"Putterman","year":"2024"},{"key":"ref23","article-title":"List-decodable codes: (randomized) constructions and applications","author":"Resch","year":"2020","journal-title":"School Comput. Sci., Carnegie Mellon Univ., Pittsburgh, PA, USA, Tech. Rep., CMU-CS-20\u2013113"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/isit63088.2025.11195274"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.21236\/AD0407946"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195274.pdf?arnumber=11195274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:18Z","timestamp":1773347418000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195274\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195274","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}