{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:44:35Z","timestamp":1730274275401,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/isit.2017.8007049","type":"proceedings-article","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T18:54:37Z","timestamp":1504032877000},"page":"2845-2849","source":"Crossref","is-referenced-by-count":1,"title":["Universal decoding using a noisy codebook"],"prefix":"10.1109","author":[{"given":"Neri","family":"Merhav","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1561\/0100000051"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.705554"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169130"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.243443"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2266657"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007049"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177697807"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2016057"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228096"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033694"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003838"},{"key":"ref5","first-page":"1","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"b39","author":"dempster","year":"1977","journal-title":"J Roy Statist Soc"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1003837"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.705540"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056524"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177699147"},{"key":"ref9","first-page":"97","article-title":"Nonprobabilistic mutual information without memory","volume":"4","author":"goppa","year":"1975","journal-title":"Probl Cont Information Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057068"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.108249"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055934"}],"event":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2017,6,25]]},"location":"Aachen, Germany","end":{"date-parts":[[2017,6,30]]}},"container-title":["2017 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999336\/8006474\/08007049.pdf?arnumber=8007049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,7]],"date-time":"2017-09-07T04:45:26Z","timestamp":1504759526000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8007049\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit.2017.8007049","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}