{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T20:04:59Z","timestamp":1784318699099,"version":"3.55.0"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["3450\/24"],"award-info":[{"award-number":["3450\/24"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Alon Fellowship"},{"name":"Veni Grant from the Dutch Research Council [Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)]","award":["VI.Veni.222.347"],"award-info":[{"award-number":["VI.Veni.222.347"]}]},{"name":"National Key Research and Development Program of China","award":["2023YFE0123900"],"award-info":[{"award-number":["2023YFE0123900"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571577"],"award-info":[{"award-number":["12571577"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12361141818"],"award-info":[{"award-number":["12361141818"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12426302"],"award-info":[{"award-number":["12426302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1109\/tit.2026.3702908","type":"journal-article","created":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T19:59:39Z","timestamp":1781207979000},"page":"5501-5515","source":"Crossref","is-referenced-by-count":0,"title":["Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7947-1205","authenticated-orcid":false,"given":"Jonathan","family":"Mosheiff","sequence":"first","affiliation":[{"name":"Stein Faculty of Computer and Information Science, Ben Gurion University of the Negev, Be'er Sheva, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5133-5631","authenticated-orcid":false,"given":"Nicolas","family":"Resch","sequence":"additional","affiliation":[{"name":"Informatics Institute, University of Amsterdam, Amsterdam, Netherland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3409-7591","authenticated-orcid":false,"given":"Kuo","family":"Shang","sequence":"additional","affiliation":[{"name":"School of Computer Science, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3730-8397","authenticated-orcid":false,"given":"Chen","family":"Yuan","sequence":"additional","affiliation":[{"name":"School of Computer Science, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"ref2","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"Varshamov","year":"1957","journal-title":"Docklady Akad. Nauk, SSSR"},{"key":"ref3","first-page":"94","article-title":"List decoding for noisy channels","author":"Elias","year":"1957","journal-title":"Wescon Conv. Rec."},{"key":"ref4","first-page":"90","article-title":"List decoding","volume-title":"Quarter Prog. Rep.","volume":"48","author":"Wozencraft","year":"1958"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275486"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52282-4_44"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0222080"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1533"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.2001.959942"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510023"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780562"},{"key":"ref15","first-page":"756","article-title":"Efficiently decodable codes meeting Gilbert\u2013Varshamov bound for low rates","volume-title":"Proc. SODA","volume":"4","author":"Guruswami"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451116"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00102"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.91"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22006-7_47"},{"key":"ref22","first-page":"55:1","article-title":"High-probability list-recovery, and applications to heavy hitters","volume-title":"Proc. 49th Int. Colloq. Automata, Lang., Program. (ICALP)","author":"Doron"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451046"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055408"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00048"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451126"},{"issue":"4","key":"ref28","first-page":"29","article-title":"List concatenated decoding","volume":"17","author":"Zyablov","year":"1981","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.995539"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2010.2095170"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.31"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488716"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.42"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2020.3041650"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127126"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.19086\/aic.2025.8"},{"key":"ref38","article-title":"Local properties of Reed\u2013Solomon codes and random linear codes","author":"Levi","year":"2024","journal-title":"arXiv:2406.02238"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/focs46700.2020.00050"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00011"},{"key":"ref41","first-page":"1458","article-title":"Pseudorandom linear codes are list-decodable to capacity","volume-title":"Proc. 15th Innov. Theor. Comput. Sci. Conf. (ITCS)","author":"Putterman"},{"key":"ref42","article-title":"List-decodable codes: (Randomized) constructions and applications","author":"Resch","year":"2020"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_11"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64381-2_16"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_21"},{"issue":"4","key":"ref46","first-page":"13","article-title":"Hamming quasi-cyclic (HQC)","volume":"2","author":"Melchor","year":"2018","journal-title":"NIST PQC Round"},{"key":"ref47","article-title":"BIKE: Bit flipping key encapsulation (Spec v5.1)","author":"Aragon","year":"2022"},{"key":"ref48","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"4244","author":"McEliece","year":"1978","journal-title":"Coding Thv"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_18"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/focs46700.2020.00103"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38551-3_19"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_31"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/080725398"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/2554797.2554815"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.21236\/ad0407946"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1561\/0100000004"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3123497"},{"key":"ref61","first-page":"50:1","article-title":"Improved list-decodability of random linear binary codes","volume":"116","author":"Li","year":"2018","journal-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2018)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11611849\/11558500.pdf?arnumber=11558500","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T19:44:30Z","timestamp":1784317470000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11558500\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":61,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tit.2026.3702908","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,8]]}}}