{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:12Z","timestamp":1773377892688,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834849","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2565-2570","source":"Crossref","is-referenced-by-count":10,"title":["Singleton-type bounds for list-decoding and list-recovery, and related results"],"prefix":"10.1109","author":[{"given":"Eitan","family":"Goldberg","sequence":"first","affiliation":[{"name":"Tel-Aviv University,Department of Electrical Engineering–Systems,Tel-Aviv,Israel"}]},{"given":"Chong","family":"Shangguan","sequence":"additional","affiliation":[{"name":"Tel-Aviv University,Department of Electrical Engineering–Systems,Tel-Aviv,Israel"}]},{"given":"Itzhak","family":"Tamo","sequence":"additional","affiliation":[{"name":"Tel-Aviv University,Department of Electrical Engineering–Systems,Tel-Aviv,Israel"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6193-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"ref14","first-page":"30:1","article-title":"On the list recoverability of randomly punctured codes","volume":"176","author":"lund","year":"2020","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1653"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2000.1730"},{"key":"ref17","article-title":"Essential coding theory","author":"guruswami","year":"2019"},{"key":"ref18","article-title":"Average-radius list-recovery of random linear codes: it really ties the room together","author":"rudra","year":"2017","journal-title":"CoRR"},{"key":"ref19","article-title":"List-Decodable Codes: (Randomized) Constructions and Applications","author":"resch","year":"2020","journal-title":"PhD thesis"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959942"},{"key":"ref3","first-page":"90","article-title":"List decoding","volume":"48","author":"wozencraft","year":"1958","journal-title":"Quart Progr Rep Res Lab Electron MIT"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780562"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510023"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2307\/3212384"},{"key":"ref7","first-page":"756","article-title":"Efficiently decodable codes meeting gilbert-varshamov bound for low rates","volume":"4","author":"guruswami","year":"2004","journal-title":"SODA"},{"key":"ref2","first-page":"99","article-title":"List decoding for noisy channels","author":"elias","year":"1957","journal-title":"Institute of Radio Engineers WESCON Convention Record"},{"key":"ref9","first-page":"11","article-title":"Bounds for codes in decoding by a list of finite length","volume":"22","author":"blinovski?","year":"1986","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref1","article-title":"Singleton-type bounds for list-decoding and list-recovery, and related results","author":"goldberg","year":"2021","journal-title":"CoRR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384295"},{"key":"ref22","article-title":"Higher-order MDS codes","author":"roth","year":"2021","journal-title":"CoRR"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025538"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/19M1248108"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02018585","article-title":"On the existence of triangulated spheres in 3-graphs, and related problems","volume":"3","author":"brown","year":"1973","journal-title":"Period Math Hungar"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(68)80051-1"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0035-9"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834849.pdf?arnumber=9834849","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:29Z","timestamp":1773347729000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834849\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834849","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}