{"id":"https://openalex.org/W2567304693","doi":"https://doi.org/10.1109/tit.2012.2214202","title":"Extension of the Blahut\u2013Arimoto Algorithm for Maximizing Directed Information","display_name":"Extension of the Blahut\u2013Arimoto Algorithm for Maximizing Directed Information","publication_year":2012,"publication_date":"2012-09-12","ids":{"openalex":"https://openalex.org/W2567304693","doi":"https://doi.org/10.1109/tit.2012.2214202","mag":"2567304693"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2214202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2214202","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010207258","display_name":"Iddo Naiss","orcid":null},"institutions":[{"id":"https://openalex.org/I4210131878","display_name":"Samsung (Israel)","ror":"https://ror.org/03k1ymh78","country_code":"IL","type":"company","lineage":["https://openalex.org/I2250650973","https://openalex.org/I4210131878"]},{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Iddo Naiss","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beersheva, Israel","Samsung Electronics, Tel-Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beersheva, Israel","institution_ids":["https://openalex.org/I124227911"]},{"raw_affiliation_string":"Samsung Electronics, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I4210131878"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068879871","display_name":"Haim H. Permuter","orcid":"https://orcid.org/0000-0003-3170-3190"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Haim H. Permuter","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beersheva, Israel"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beersheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5010207258"],"corresponding_institution_ids":["https://openalex.org/I124227911","https://openalex.org/I4210131878"],"apc_list":null,"apc_paid":null,"fwci":3.3791,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.9317758,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"59","issue":"1","first_page":"204","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13553","display_name":"Age of Information Optimization","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6800140738487244},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6434286236763},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5341020822525024},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5253885388374329},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47737357020378113},{"id":"https://openalex.org/keywords/expectation\u2013maximization-algorithm","display_name":"Expectation\u2013maximization algorithm","score":0.43195387721061707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4311474561691284},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3687361776828766},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.10463821887969971},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10235962271690369}],"concepts":[{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6800140738487244},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6434286236763},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5341020822525024},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5253885388374329},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47737357020378113},{"id":"https://openalex.org/C182081679","wikidata":"https://www.wikidata.org/wiki/Q1275153","display_name":"Expectation\u2013maximization algorithm","level":3,"score":0.43195387721061707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4311474561691284},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3687361776828766},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.10463821887969971},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10235962271690369},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2012.2214202","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2214202","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1489262227","https://openalex.org/W1967203244","https://openalex.org/W1986389751","https://openalex.org/W1989008275","https://openalex.org/W1995875735","https://openalex.org/W2018640312","https://openalex.org/W2024886389","https://openalex.org/W2028558913","https://openalex.org/W2029236670","https://openalex.org/W2039464200","https://openalex.org/W2060049742","https://openalex.org/W2070432296","https://openalex.org/W2082484220","https://openalex.org/W2083048215","https://openalex.org/W2115469356","https://openalex.org/W2118917401","https://openalex.org/W2120379926","https://openalex.org/W2134392502","https://openalex.org/W2141021549","https://openalex.org/W2141183773","https://openalex.org/W2147700406","https://openalex.org/W2148986322","https://openalex.org/W2149554817","https://openalex.org/W2151263123","https://openalex.org/W2163389339","https://openalex.org/W2164684058","https://openalex.org/W2165397914","https://openalex.org/W2478708596","https://openalex.org/W2532607215","https://openalex.org/W2592416308","https://openalex.org/W2993383518","https://openalex.org/W3193262203","https://openalex.org/W4250589301","https://openalex.org/W4300079393"],"related_works":["https://openalex.org/W2075768550","https://openalex.org/W3022218857","https://openalex.org/W2369178846","https://openalex.org/W2082716031","https://openalex.org/W1976188970","https://openalex.org/W2037938733","https://openalex.org/W2001839669","https://openalex.org/W2990541822","https://openalex.org/W1588885902","https://openalex.org/W1965352811"],"abstract_inverted_index":{"In":[0,37],"this":[1,81],"paper,":[2],"we":[3,44],"extend":[4],"the":[5,20,28,35,41,46,49,54,73,89,92,112,122,128],"Blahut-Arimoto":[6,51],"algorithm":[7,14],"for":[8,18],"maximizing":[9],"Massey's":[10],"directed":[11,42,93],"information.":[12],"The":[13],"can":[15,103],"be":[16],"used":[17],"estimating":[19],"capacity":[21],"of":[22,34,91,121],"channels":[23],"with":[24,111],"delayed":[25],"feedback,":[26],"where":[27],"feedback":[29],"is":[30,83],"a":[31,96,105,118],"deterministic":[32],"function":[33],"output.":[36],"order":[38,86],"to":[39,58,72,87],"maximize":[40],"information,":[43],"apply":[45],"ideas":[47],"from":[48],"regular":[50],"algorithm,":[52,123],"i.e.,":[53],"alternating":[55,113],"maximization":[56,109,114],"procedure,":[57],"our":[59],"new":[60],"problem.":[61],"We":[62,116],"provide":[63],"both":[64],"upper":[65],"and":[66,127,131],"lower":[67],"bound":[68],"sequences":[69],"that":[70,84],"converge":[71],"optimum":[74],"global":[75],"value.":[76],"Our":[77],"main":[78],"insight":[79],"in":[80,85],"paper":[82],"find":[88],"maximum":[90],"information":[94],"over":[95],"causal":[97],"conditioning":[98],"probability":[99],"mass":[100],"function,":[101],"one":[102],"use":[104],"backward":[106],"index":[107],"time":[108],"combined":[110],"procedure.":[115],"give":[117],"detailed":[119],"description":[120],"showing":[124],"its":[125],"complexity":[126],"memory":[129],"needed,":[130],"present":[132],"several":[133],"numerical":[134],"examples.":[135]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}