{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:39:53Z","timestamp":1773376793511,"version":"3.50.1"},"reference-count":27,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,7,7]]},"DOI":"10.1109\/isit57864.2024.10619601","type":"proceedings-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T13:25:01Z","timestamp":1724073901000},"page":"711-716","source":"Crossref","is-referenced-by-count":5,"title":["Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity"],"prefix":"10.1109","author":[{"given":"Luca","family":"Barletta","sequence":"first","affiliation":[{"name":"Politecnico di Milano,Milano,Italy,20133"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Zieder","sequence":"additional","affiliation":[{"name":"New Jersey Institute of Technology,Newark,NJ,USA,07102"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonino","family":"Favano","sequence":"additional","affiliation":[{"name":"Politecnico di Milano,Milano,Italy,20133"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Dytso","sequence":"additional","affiliation":[{"name":"Qualcomm Flarion Technologies,Bridgewater,NJ,USA,08807"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2020.3035371"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.101813.121884"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006973"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2919455"},{"key":"ref5","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3281275"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.935990"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/18.556120"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056173"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2307070"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3130381"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206627"},{"key":"ref13","article-title":"Binomial channel: On the capacity-achieving distribution and bounds on the capacity","author":"Zieder","year":"2024","journal-title":"arXiv preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2018.8362306"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/1385-7258(74)90000-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(71)90346-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.56021\/9781421407944"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/18.923716"},{"key":"ref19","first-page":"63","article-title":"The practical limits of photon communication","volume":"42","author":"McEliece","year":"1979","journal-title":"Jet Propulsion Laboratory Deep Space Network Progress Reports"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2948636"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3111836"},{"key":"ref22","article-title":"How many modes can a constrained Gaussian mixture have","author":"Kashyap","year":"2020","journal-title":"arXiv preprint"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008121"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365385"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2692214"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-9659(98)00013-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437888"}],"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\/10619601.pdf?arnumber=10619601","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:22Z","timestamp":1773347302000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10619601\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,7]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/isit57864.2024.10619601","relation":{},"subject":[],"published":{"date-parts":[[2024,7,7]]}}}