{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:31:25Z","timestamp":1774679485914,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2009,2,1]],"date-time":"2009-02-01T00:00:00Z","timestamp":1233446400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1109\/tit.2008.2009581","type":"journal-article","created":{"date-parts":[[2009,2,13]],"date-time":"2009-02-13T18:54:48Z","timestamp":1234551288000},"page":"663-688","source":"Crossref","is-referenced-by-count":35,"title":["Optimization of Information Rate Upper and Lower Bounds for Channels With Memory"],"prefix":"10.1109","volume":"55","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":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261588"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/49.947035"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/26.996063"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.490551"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20030410"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/25.765000"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920243"},{"key":"ref11","first-page":"457","article-title":"computation of information rates from finite state\/source channel models","author":"arnold","year":"2002","journal-title":"Proc 40th Allerton Conf Communications Control and Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.887846"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557222"},{"key":"ref15","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"},{"key":"ref16","author":"press","year":"1992","journal-title":"Numerical Recipes in C"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2007.4409080"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1960.tb03959.x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1963.tb00955.x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2008.926683"},{"key":"ref4","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060622"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.878110"},{"key":"ref6","first-page":"283","article-title":"entropy and channel capacity in the regenerative setup with applications to markov channels","author":"sharma","year":"2001","journal-title":"Proc IEEE Int Symp Information Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312554"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2001.936639"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2001.955166"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965976"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.720551"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842626"},{"key":"ref1","author":"proakis","year":"2000","journal-title":"Digital Communications"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009861"},{"key":"ref22","first-page":"1","article-title":"an inequality and associated maximization technique in statistical estimation for probabilistic functions of a markov process","volume":"3","author":"baum","year":"1972","journal-title":"Inequalities"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","author":"cover","year":"1991","journal-title":"Elements of Information Theory ser Wiley Series in Telecommunications"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.831156"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176346060"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1968.tb00069.x"},{"key":"ref25","author":"rusek","year":"2007","journal-title":"Partial Response and Faster-Than-Nyquist Signaling"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4777616\/04777638.pdf?arnumber=4777638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T18:16:16Z","timestamp":1738952176000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4777638\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2]]},"references-count":35,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.2008.2009581","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,2]]}}}