{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:18:57Z","timestamp":1761718737393,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1109\/ita.2018.8503225","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:42:52Z","timestamp":1540510972000},"page":"1-5","source":"Crossref","is-referenced-by-count":17,"title":["Efficient Binomial Channel Capacity Computation with an Application to Molecular Communication"],"prefix":"10.1109","author":[{"given":"Richard D.","family":"Wesel","sequence":"first","affiliation":[]},{"given":"Emily E.","family":"Wesel","sequence":"additional","affiliation":[]},{"given":"Lieven","family":"Vandenberghe","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Komninakis","sequence":"additional","affiliation":[]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Information Theory and Reliable Communications","year":"1968","author":"gallager","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-247X(62)80007-9"},{"journal-title":"Optimization by vector space methods","year":"1969","author":"luenberger","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2537302"},{"key":"ref11","first-page":"191","article-title":"A polynomial algorithm in linear programming","volume":"20","author":"khachiyan","year":"1979","journal-title":"Dok-lady Akademiia Nauk SSSR (translated in Soviet Mathematics Doklady"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006973"},{"journal-title":"InformationTheory Coding Theorems for Discrete Memoryless Systems ser Probability and Mathematical Statistics Z Birnbaum and E Lukacs Eds","year":"1981","author":"csis\u00e1r","key":"ref12"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.29.6.1039"},{"key":"ref7","article-title":"Capacity of the binomial channel, or minimax redundancy for mempryless sources","author":"komninakis","year":"2001","journal-title":"Proceedings of the IEEE International Symposium on Information Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056173"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"}],"event":{"name":"2018 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2018,2,11]]},"location":"San Diego, CA","end":{"date-parts":[[2018,2,16]]}},"container-title":["2018 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8486613\/8502949\/08503225.pdf?arnumber=8503225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T21:56:40Z","timestamp":1643234200000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8503225\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ita.2018.8503225","relation":{},"subject":[],"published":{"date-parts":[[2018,2]]}}}