{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T21:03:40Z","timestamp":1774991020249,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541726","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"2384-2388","source":"Crossref","is-referenced-by-count":1,"title":["Zero-rate achievability of posterior matching schemes for channels with memory"],"prefix":"10.1109","author":[{"given":"Jui","family":"Wu","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, 48105 USA"}]},{"given":"Achilleas","family":"Anastasopoulos","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, 48105 USA"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033825"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875257"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008147"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513683"},{"key":"ref5","first-page":"3151","article-title":"When do nonlinear filters achieve maximal accuracy?","volume":"48","author":"van","year":"2009","journal-title":"SIAM Journal on Control and Optimization"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924681"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284059"},{"key":"ref2","article-title":"A simple proof for the optimality of randomized posterior matching","author":"shayevitz","year":"2015","journal-title":"arXiv preprint arXiv 1507 08929"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/0331018"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104992"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541726.pdf?arnumber=7541726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:52:55Z","timestamp":1774986775000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541726\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541726","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}