{"id":"https://openalex.org/W2044986946","doi":"https://doi.org/10.1109/isit.2007.4557222","title":"Optimizing Information Rate Bounds for Channels with Memory","display_name":"Optimizing Information Rate Bounds for Channels with Memory","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2044986946","doi":"https://doi.org/10.1109/isit.2007.4557222","mag":"2044986946"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557222","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557222","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","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/A5068612701","display_name":"Parastoo Sadeghi","orcid":"https://orcid.org/0000-0002-9965-9483"},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Parastoo Sadeghi","raw_affiliation_strings":["Australian National University, Canberra, Australia","Australian National University Canberra"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Australian National University, Canberra, Australia","institution_ids":["https://openalex.org/I118347636"]},{"raw_affiliation_string":"Australian National University Canberra","institution_ids":["https://openalex.org/I118347636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028154201","display_name":"Pascal O. Vontobel","orcid":"https://orcid.org/0000-0002-6180-258X"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pascal O. Vontobel","raw_affiliation_strings":["Hewlett-Packard Laboratories, Palo Alto, CA, USA","Hewlett-Packard Laboratories, Palo Alto, CA 94304, USA. pascal.vontobel@ieee.org"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hewlett-Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett-Packard Laboratories, Palo Alto, CA 94304, USA. pascal.vontobel@ieee.org","institution_ids":["https://openalex.org/I1324840837"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088375969","display_name":"Ramtin Shams","orcid":null},"institutions":[{"id":"https://openalex.org/I118347636","display_name":"Australian National University","ror":"https://ror.org/019wvm592","country_code":"AU","type":"education","lineage":["https://openalex.org/I118347636"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Ramtin Shams","raw_affiliation_strings":["Australian National University, Canberra, Australia","The Australian National University, Canberra 0200 ACT, Australia. ramtin.shams@anu.edu.au"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Australian National University, Canberra, Australia","institution_ids":["https://openalex.org/I118347636"]},{"raw_affiliation_string":"The Australian National University, Canberra 0200 ACT, Australia. ramtin.shams@anu.edu.au","institution_ids":["https://openalex.org/I118347636"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4369,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.82420385,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"i","issue":null,"first_page":"171","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9991999864578247,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8180310130119324},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.6709445714950562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6546621322631836},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5947875380516052},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.583856463432312},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5686076283454895},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.5557590126991272},{"id":"https://openalex.org/keywords/channel-state-information","display_name":"Channel state information","score":0.5282591581344604},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5011274814605713},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4427235722541809},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4376308023929596},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3217090666294098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2716313600540161},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.2547685503959656},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13962805271148682},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1106034517288208},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10264411568641663}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8180310130119324},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.6709445714950562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6546621322631836},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5947875380516052},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.583856463432312},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5686076283454895},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.5557590126991272},{"id":"https://openalex.org/C148063708","wikidata":"https://www.wikidata.org/wiki/Q5072511","display_name":"Channel state information","level":3,"score":0.5282591581344604},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5011274814605713},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4427235722541809},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4376308023929596},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3217090666294098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2716313600540161},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.2547685503959656},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13962805271148682},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1106034517288208},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10264411568641663},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2007.4557222","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557222","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.335.1791","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.335.1791","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.cecs.anu.edu.au/~parastoo/papers/2007/ISIT_2007.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.841.3433","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.841.3433","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://users.cecs.anu.edu.au/%7Eramtin/papers/2007/ISIT_2007.pdf","raw_type":"text"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/24766","is_oa":false,"landing_page_url":"http://hdl.handle.net/1885/24766","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of IEEE International Symposium on Information Theory (ISIT 2007)","raw_type":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1943431639","https://openalex.org/W1989008275","https://openalex.org/W2070432296","https://openalex.org/W2098257210","https://openalex.org/W2108033855","https://openalex.org/W2127029953","https://openalex.org/W2131342300","https://openalex.org/W2142901448","https://openalex.org/W2148578757","https://openalex.org/W2163619651","https://openalex.org/W2165808853","https://openalex.org/W2258157321","https://openalex.org/W2798333393","https://openalex.org/W4245808720","https://openalex.org/W6668035726","https://openalex.org/W6679966601","https://openalex.org/W6806087461","https://openalex.org/W7018733341","https://openalex.org/W7020947054"],"related_works":["https://openalex.org/W2033294096","https://openalex.org/W1992327031","https://openalex.org/W2088214533","https://openalex.org/W2350045617","https://openalex.org/W2337233433","https://openalex.org/W2071990171","https://openalex.org/W4293794509","https://openalex.org/W1979887454","https://openalex.org/W2103675451","https://openalex.org/W1992552711"],"abstract_inverted_index":{"We":[0,109,145],"consider":[1],"the":[2,35,55,58,70,77,83,91,95,100,106,115,119,122,125,134,137,156],"problem":[3],"of":[4,38,57,86,136,148,155],"optimizing":[5,69,114],"information":[6,36,80,84,163],"rate":[7,37,85,164],"upper":[8,30,116,123],"and":[9,31,103,118,124,128],"lower":[10,32,71,126,138],"bounds":[11,33],"for":[12,113,133,140,152],"communication":[13,88],"channels":[14,142,149],"with":[15,143,150],"(possibly":[16],"large)":[17],"memory.":[18,144],"A":[19],"recently":[20],"proposed":[21],"auxiliary-channel-":[22],"based":[23],"technique":[24],"allows":[25],"one":[26],"to":[27,53,75,99,105],"efficiently":[28],"compute":[29],"on":[34],"such":[39],"channels.":[40],"Towards":[41],"tightening":[42],"these":[43],"bounds,":[44],"we":[45,129],"propose":[46],"iterative":[47],"expectation-":[48],"maximization":[49],"(EM)":[50],"type":[51],"algorithms":[52],"optimize":[54],"parameters":[56],"auxiliary":[59,101],"finite-state":[60],"machine":[61],"channel":[62,66,102],"(FSMC).":[63],"From":[64],"a":[65,87,131],"coding":[67],"perspective,":[68],"bound":[72,117,127,139],"is":[73,97],"related":[74],"increasing":[76],"achievable":[78],"mismatched":[79],"rate,":[81],"i.e.":[82],"system":[89],"where":[90],"maximum-likelihood":[92],"decoder":[93],"at":[94],"receiver":[96],"matched":[98],"not":[104],"true":[107],"channel.":[108],"provide":[110],"explicit":[111],"solutions":[112],"difference":[120],"between":[121],"discuss":[130,146],"method":[132],"optimization":[135],"data-controllable":[141],"examples":[147],"memory,":[151],"which":[153],"application":[154],"developed":[157],"theory":[158],"results":[159],"in":[160],"noticeably":[161],"tighter":[162],"bounds.":[165]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}