{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:27Z","timestamp":1771611027696,"version":"3.50.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["852953"],"award-info":[{"award-number":["852953"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1109\/tit.2024.3402171","type":"journal-article","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T17:23:39Z","timestamp":1715880219000},"page":"8659-8668","source":"Crossref","is-referenced-by-count":10,"title":["Tighter List-Size Bounds for List-Decoding and Recovery of Folded Reed-Solomon and Multiplicity Codes"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8000-0419","authenticated-orcid":false,"given":"Itzhak","family":"Tamo","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering–Systems, Tel Aviv University, Tel Aviv, Israel"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"issue":"1","key":"ref2","first-page":"11","article-title":"Bounds for codes in decoding by a list of finite length","volume":"22","author":"Blinovskii","year":"1986","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.2307\/3212384"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/346048.346049"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1561\/0400000010"},{"key":"ref6","article-title":"List Decoding for Noisy Channels","volume-title":"Wescon Convention Record","author":"Elias","year":"1957"},{"key":"ref7","first-page":"90","article-title":"List decoding","volume-title":"Quarterly Progress Report","volume":"48","author":"Wozencraft","year":"1958"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"issue":"1","key":"ref12","first-page":"55","article-title":"Codes for the m-metric","volume":"33","author":"Rosenbloom","year":"1997","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/20M1370215"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214010"},{"key":"ref17","first-page":"538","article-title":"Combinatorial list-decoding of Reed\u2013Solomon codes beyond the Johnson radius","volume-title":"Proc. 52nd Annu. ACM SIGACT Symp. Theory Comput.","author":"Shangguan"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2011.22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206952"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977912.55"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"ref24","article-title":"Randomly punctured Reed\u2013Solomon codes achieve list-decoding capacity over linear-sized fields","author":"Alrabiah","year":"2023","journal-title":"arXiv:2304.09445"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2629416"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10767121\/10532214.pdf?arnumber=10532214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T18:59:35Z","timestamp":1732733975000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10532214\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":25,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tit.2024.3402171","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]}}}