{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,3]],"date-time":"2025-10-03T09:07:44Z","timestamp":1759482464137,"version":"3.37.3"},"reference-count":18,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NSF Center for Science of Information","award":["CCF-0939370"],"award-info":[{"award-number":["CCF-0939370"]}]},{"name":"MIT-Technion postdoctoral fellowship"},{"name":"ERC","award":["639573"],"award-info":[{"award-number":["639573"]}]},{"name":"ISF","award":["1367\/14"],"award-info":[{"award-number":["1367\/14"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/tit.2016.2609390","type":"journal-article","created":{"date-parts":[[2016,9,14]],"date-time":"2016-09-14T18:24:10Z","timestamp":1473877450000},"page":"6068-6080","source":"Crossref","is-referenced-by-count":5,"title":["Mutual Information Bounds via Adjacency Events"],"prefix":"10.1109","volume":"62","author":[{"given":"Yanjun","family":"Han","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5791-7923","authenticated-orcid":false,"given":"Or","family":"Ordentlich","sequence":"additional","affiliation":[]},{"given":"Ofer","family":"Shayevitz","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/TIT.1972.1054855"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref12","first-page":"205","article-title":"Information geometry and alternating minimization procedures","author":"csisz\u00e1r","year":"1984","journal-title":"Statist Decisions"},{"year":"1999","author":"bertsekas","journal-title":"Nonlinear Programming","key":"ref13"},{"year":"1961","author":"gallager","article-title":"Sequential decoding for binary channels with noise and synchronization errors","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/TIT.2013.2262019"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/978-3-642-03311-7"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1109\/ISIT.2012.6283980"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1017\/CBO9781139814782"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/TIT.2006.881832"},{"key":"ref3","first-page":"573","article-title":"On transmission over deletion channels","volume":"39","author":"diggavi","year":"2001","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1109\/TIT.2014.2326877"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1017\/CBO9781139030687"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1002\/0471200611"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1002\/9781118165904"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1214\/08-PS141"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1090\/trans2\/033\/11"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the em algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Roy Statist Soc Ser B (Methodological)"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7593371\/07567587.pdf?arnumber=7567587","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,19]],"date-time":"2024-06-19T10:43:04Z","timestamp":1718793784000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7567587\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":18,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2609390","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}