{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:31Z","timestamp":1773377071461,"version":"3.50.1"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195617","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Channel Resolvability Using Multiplicative Weight Update Algorithm"],"prefix":"10.1109","author":[{"given":"Koki","family":"Takahashi","sequence":"first","affiliation":[{"name":"Tokyo University of Agriculture and Technology,Department of Computer and Information Sciences,Japan"}]},{"given":"Shun","family":"Watanabe","sequence":"additional","affiliation":[{"name":"Tokyo University of Agriculture and Technology,Department of Computer and Information Sciences,Japan"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11889342_40"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.42172"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.985947"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2674669"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"ref6","article-title":"Information theory","author":"Ash.","year":"1965","journal-title":"Dover Publications"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2628307"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706106"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2283722"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3005458"},{"key":"ref11","article-title":"Identification and Zero-Error Codes","volume-title":"Ph.D. dissertation, Princeton University","author":"Bracher","year":"2016"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-82014-4_13"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.887853"},{"issue":"1","key":"ref14","first-page":"48","article-title":"Almost independence and secrecy capacity","volume":"32","author":"Csisz\u00e1r.","year":"1996","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref15","article-title":"Information theory Coding Theorems for Discrete Memoryless Systems","author":"Csisz\u00e1r","year":"2011","journal-title":"Cambridge University Press"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2279330"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057459"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12066-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/18.108245"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.256486"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871040"},{"key":"ref22","article-title":"Efficient Algorithm Using Multiplicative Weight Update Method","volume-title":"Ph.D. dissertation, Princeton University","author":"Kale.","year":"2007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.23919\/ISITA.2018.8664277"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058842"},{"issue":"5","key":"ref25","first-page":"2629","article-title":"e_{\u1d67}-resolvability","volume":"63","author":"Liu","year":"2017","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3009208"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896874"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620507"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3259580"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-023-04107-w"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.669139"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.923724"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT63088.2025.11195617"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IOTM.001.2300166"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513463"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120033"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3152613"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.796385"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.3390\/e25101466"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2917182"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2441058"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2885318"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195617.pdf?arnumber=11195617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:29Z","timestamp":1773347429000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195617\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195617","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}