{"id":"https://openalex.org/W4289655299","doi":"https://doi.org/10.1109/isit50566.2022.9834817","title":"Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties","display_name":"Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655299","doi":"https://doi.org/10.1109/isit50566.2022.9834817"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834817","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834817","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5051051058","display_name":"Andrea Grigorescu","orcid":"https://orcid.org/0000-0001-6760-7542"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andrea Grigorescu","raw_affiliation_strings":["Technical University of Munich,Chair of Theoretical Information Technology","Chair of Theoretical Information Technology, Technical University of Munich"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Chair of Theoretical Information Technology","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Chair of Theoretical Information Technology, Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000732219","display_name":"Holger Boche","orcid":"https://orcid.org/0000-0002-8375-8946"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]},{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Holger Boche","raw_affiliation_strings":["Technical University of Munich,Chair of Theoretical Information Technology","BMBF Research Hub 6G-Life","Chair of Theoretical Information Technology, Technical University of Munich","CASA Excellence Cluster Ruhr University Bochum"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich,Chair of Theoretical Information Technology","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"BMBF Research Hub 6G-Life","institution_ids":[]},{"raw_affiliation_string":"Chair of Theoretical Information Technology, Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"CASA Excellence Cluster Ruhr University Bochum","institution_ids":["https://openalex.org/I904495901"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038203207","display_name":"Rafael F. Schaefer","orcid":"https://orcid.org/0000-0002-1702-9075"},"institutions":[{"id":"https://openalex.org/I206895457","display_name":"University of Siegen","ror":"https://ror.org/02azyry73","country_code":"DE","type":"education","lineage":["https://openalex.org/I206895457"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rafael F. Schaefer","raw_affiliation_strings":["Chair of Communications Engineering and Security University of Siegen"],"affiliations":[{"raw_affiliation_string":"Chair of Communications Engineering and Security University of Siegen","institution_ids":["https://openalex.org/I206895457"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042307561","display_name":"H. Vincent Poor","orcid":"https://orcid.org/0000-0002-2062-131X"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Vincent Poor","raw_affiliation_strings":["Princeton University,Dept. of Electrical and Computer Engineering","Dept. of Electrical and Computer Engineering, Princeton University"],"affiliations":[{"raw_affiliation_string":"Princeton University,Dept. of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, Princeton University","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051051058"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":2.8492,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.92656766,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"498","last_page":"503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/converse","display_name":"Converse","score":0.7940177321434021},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5278974175453186},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47082406282424927},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.45913201570510864},{"id":"https://openalex.org/keywords/finite-state","display_name":"Finite state","score":0.4543234407901764},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42517679929733276},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39496690034866333},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36600619554519653},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.31048446893692017}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.7940177321434021},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5278974175453186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47082406282424927},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.45913201570510864},{"id":"https://openalex.org/C2983497884","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite state","level":3,"score":0.4543234407901764},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42517679929733276},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39496690034866333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36600619554519653},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31048446893692017},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834817","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834817","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321408","display_name":"Ministry of Education","ror":"https://ror.org/01p262204"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":43,"referenced_works":["https://openalex.org/W1483568252","https://openalex.org/W1489262227","https://openalex.org/W1972435751","https://openalex.org/W2020347709","https://openalex.org/W2022731279","https://openalex.org/W2024886389","https://openalex.org/W2029236670","https://openalex.org/W2056414301","https://openalex.org/W2061970672","https://openalex.org/W2063002186","https://openalex.org/W2109394932","https://openalex.org/W2118917401","https://openalex.org/W2126160338","https://openalex.org/W2127079426","https://openalex.org/W2129885443","https://openalex.org/W2140911775","https://openalex.org/W2148986322","https://openalex.org/W2156216606","https://openalex.org/W2158013409","https://openalex.org/W2163389339","https://openalex.org/W2164684058","https://openalex.org/W2165397914","https://openalex.org/W2216796597","https://openalex.org/W2331346174","https://openalex.org/W2792587149","https://openalex.org/W2963735785","https://openalex.org/W2964209511","https://openalex.org/W2974993339","https://openalex.org/W2975439954","https://openalex.org/W3099242402","https://openalex.org/W3103109578","https://openalex.org/W3107421261","https://openalex.org/W3175542129","https://openalex.org/W3190595840","https://openalex.org/W4205855417","https://openalex.org/W4243563333","https://openalex.org/W4289655299","https://openalex.org/W4300665568","https://openalex.org/W6629237864","https://openalex.org/W6656063086","https://openalex.org/W6678934100","https://openalex.org/W6681130209","https://openalex.org/W6682997457"],"related_works":["https://openalex.org/W2387449261","https://openalex.org/W2418518962","https://openalex.org/W2963377682","https://openalex.org/W2043159103","https://openalex.org/W2385736480","https://openalex.org/W2118815061","https://openalex.org/W4297022878","https://openalex.org/W2215353002","https://openalex.org/W2354973579","https://openalex.org/W2080846028"],"abstract_inverted_index":{"The":[0],"capacity":[1,27,38,57,86,142],"of":[2,15,18,46,52,67,77,87,149,153],"finite":[3],"state":[4],"channels":[5],"(FSCs)":[6],"with":[7],"feedback":[8,37,85,141],"has":[9],"been":[10],"expressed":[11],"by":[12,48],"a":[13,16,24,42,100,150],"limit":[14],"sequence":[17],"multi-letter":[19],"expressions.":[20],"Despite":[21],"many":[22],"efforts,":[23],"closed-form":[25],"single-letter":[26],"characterization":[28],"remains":[29],"unknown":[30],"to":[31,127],"date.":[32],"In":[33],"this":[34,63],"paper,":[35],"the":[36,50,56,65,84,140,147],"is":[39,70,81,89,103,112,125,137],"studied":[40],"from":[41],"fundamental":[43,74],"algorithmic":[44],"point":[45],"view":[47],"addressing":[49],"question":[51],"whether":[53],"or":[54,108],"not":[55,90,96,113],"can":[58],"be":[59,144],"algorithmically":[60],"computed.":[61],"To":[62],"aim,":[64],"concept":[66],"Turing":[68],"machines":[69],"used,":[71],"which":[72,116,123],"provides":[73],"performance":[75],"limits":[76],"digital":[78],"computers.":[79],"It":[80],"shown":[82,104,138],"that":[83,105,118,139],"FSCs":[88,121],"Banach-Mazur":[91,114],"computable":[92,129],"and":[93,132],"therefore":[94],"also":[95],"Borel-Turing":[97],"computable.":[98],"As":[99],"consequence,":[101],"it":[102,124,136],"either":[106],"achievability":[107],"converse":[109],"(or":[110],"both)":[111],"computable,":[115],"means":[117],"there":[119],"are":[120],"for":[122],"impossible":[126],"find":[128],"tight":[130],"upper":[131],"lower":[133],"bounds.":[134],"Furthermore,":[135],"cannot":[143],"characterized":[145],"as":[146],"maximization":[148],"finite-letter":[151],"formula":[152],"entropic":[154],"quantities.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}