{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:45:24Z","timestamp":1773330324788,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013,1]]},"DOI":"10.1109\/tit.2012.2214202","type":"journal-article","created":{"date-parts":[[2012,9,12]],"date-time":"2012-09-12T01:32:30Z","timestamp":1347413550000},"page":"204-222","source":"Crossref","is-referenced-by-count":28,"title":["Extension of the Blahut\u2013Arimoto Algorithm for Maximizing Directed Information"],"prefix":"10.1109","volume":"59","author":[{"given":"Iddo","family":"Naiss","sequence":"first","affiliation":[]},{"given":"Haim H.","family":"Permuter","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.896887"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820014"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.50386"},{"key":"ref30","author":"ash","year":"1965","journal-title":"Information Theory"},{"key":"ref35","first-page":"385","author":"permuter","year":"2011","journal-title":"Computable Bounds for Rate Distortion with Feed-forward for Stationary and Ergodic Sources"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557092"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917685"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2004.1405276"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836661"},{"key":"ref13","article-title":"Arimoto–Blahut algorithms for computing channel capacity and rate-distortion with side information","author":"yu","year":"2004","journal-title":"Int Symp Inf Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056723"},{"key":"ref15","first-page":"2052","article-title":"A modified Blahut algorithm for decoding Reed Solomon codes beyond half the minimum distance","volume":"52","author":"markavian","year":"2004","journal-title":"IEEE Trans Inf Theory"},{"key":"ref16","article-title":"Numercal computation of the capacity of continuous memoryless channels","author":"dauwels","year":"2005","journal-title":"26th Symp Inf Theory"},{"key":"ref17","first-page":"1887","article-title":"Capacity of finite-state machine channels","volume":"54","author":"arnold","year":"2008","journal-title":"IEEE Trans Inf Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205855"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2011442"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1956.1056798"},{"key":"ref4","first-page":"205","article-title":"Information geometry and alternating minimization procedures","volume":"1","author":"csiszr","year":"1984","journal-title":"Statist Decis"},{"key":"ref27","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054855"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523313"},{"key":"ref29","first-page":"183","author":"blackwell","year":"1961","journal-title":"Modern Mathematics for the Engineer"},{"key":"ref5","author":"yeung","year":"2008","journal-title":"Information Theory and Network Coding"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2008147"},{"key":"ref7","author":"kramer","year":"1998","journal-title":"Directed Information for Channels with Feedback"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054753"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009849"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842626"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924681"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.842697"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1973.1091610"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513240"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref25","author":"cover","year":"2006","journal-title":"Elements of Information Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6387658\/06298962.pdf?arnumber=6298962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:51:32Z","timestamp":1633909892000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6298962\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":35,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2214202","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}