{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T07:54:13Z","timestamp":1730274853619,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1109\/isit.2007.4557222","type":"proceedings-article","created":{"date-parts":[[2008,7,9]],"date-time":"2008-07-09T00:17:12Z","timestamp":1215562632000},"page":"171-175","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing Information Rate Bounds for Channels with Memory"],"prefix":"10.1109","author":[{"given":"Parastoo","family":"Sadeghi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramtin","family":"Shams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.936639"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878110"},{"article-title":"Information Theory and Reliable Communication","year":"1968","author":"gallager","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965976"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.847161"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2001.936146"},{"key":"ref8","first-page":"2315","article-title":"Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit","volume":"i","author":"ganti","year":"2000","journal-title":"IEEE Trans on Inform Theory"},{"key":"ref7","article-title":"Computation of information rates from finite state\/source channel models","author":"arnold","year":"2002","journal-title":"Proc 40th Allerton Conf on Communications Control and Computing"},{"article-title":"Digital Communications","year":"2000","author":"proakis","key":"ref2"},{"key":"ref9","article-title":"A generalization of the Blahut-Arimoto algorithm for finite-state channels","author":"vontobel","year":"2005","journal-title":"accepted (after revisions) for IEEE Trans Inform Theory available online"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.720551"}],"event":{"name":"2007 IEEE International Symposium on Information Theory","start":{"date-parts":[[2007,6,24]]},"location":"Nice","end":{"date-parts":[[2007,6,29]]}},"container-title":["2007 IEEE International Symposium on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4497218\/4557062\/04557222.pdf?arnumber=4557222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T19:22:52Z","timestamp":1489692172000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4557222\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/isit.2007.4557222","relation":{},"subject":[],"published":{"date-parts":[[2007,6]]}}}