{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:41:41Z","timestamp":1773376901559,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,7,7]],"date-time":"2024-07-07T00:00:00Z","timestamp":1720310400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100010663","name":"European Research Council (ERC)","doi-asserted-by":"publisher","award":["852953"],"award-info":[{"award-number":["852953"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619274","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"3558-3563","source":"Crossref","is-referenced-by-count":0,"title":["Points-Polynomials Incidence Theorem with an Application to Reed-Solomon Codes"],"prefix":"10.1109","author":[{"given":"Itzhak","family":"Tamo","sequence":"first","affiliation":[{"name":"Tel Aviv University,Department of Electrical Engineering-Systems,Tel Aviv,Israel"}]}],"member":"263","reference":[{"issue":"8","key":"ref1","doi-asserted-by":"crossref","first-page":"1177","DOI":"10.1016\/j.ejc.2011.06.008","article-title":"The szemer\u00e9di-trotter type theorem and the sum-product estimate in finite fields","volume":"32","author":"Vinh","year":"2011","journal-title":"European Journal of Combinatorics"},{"key":"ref2","author":"Tamo","year":"2023","journal-title":"Points-polynomials incidence theorem with applications to coding theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579194"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(83)80036-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-004-0451-1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/18.61123"},{"issue":"1","key":"ref7","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":"ref8","doi-asserted-by":"publisher","DOI":"10.2307\/3212384"},{"key":"ref9","article-title":"List decoding for noisy channels","author":"Elias","year":"1957","journal-title":"Wescon Convention Record, Part 2. Institute of Radio Engineers"},{"key":"ref10","article-title":"List decoding","author":"Wozencraft","year":"1958","journal-title":"Research Laboratory of Electronics, MIT, Quarterly Progress Report"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref14","article-title":"A combinatorial bound on the list size","author":"Cassuto","year":"2004","journal-title":"California Institute of Technology, Paradise Laboratory Technical Report"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/100783704"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2343224"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127126"},{"issue":"1","key":"ref18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(88)90189-6","article-title":"Explicit construction of linear sized tolerant networks","volume":"72","author":"Alon","year":"1988","journal-title":"Discrete Mathematics"}],"event":{"name":"2024 IEEE International Symposium on Information Theory (ISIT)","location":"Athens, Greece","start":{"date-parts":[[2024,7,7]]},"end":{"date-parts":[[2024,7,12]]}},"container-title":["2024 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10619013\/10619074\/10619274.pdf?arnumber=10619274","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:08Z","timestamp":1773347348000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619274\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619274","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}