{"id":"https://openalex.org/W2096475427","doi":"https://doi.org/10.1109/isit.2009.5205692","title":"Capacity-achieving codes for channels with memory with maximum-likelihood decoding","display_name":"Capacity-achieving codes for channels with memory with maximum-likelihood decoding","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2096475427","doi":"https://doi.org/10.1109/isit.2009.5205692","mag":"2096475427"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205692","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 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/A5046180915","display_name":"Jung Hyun Bae","orcid":null},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jung Hyun Bae","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI","Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021002637","display_name":"Achilleas Anastasopoulos","orcid":"https://orcid.org/0000-0003-3795-1654"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Achilleas Anastasopoulos","raw_affiliation_strings":["Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI","Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI","institution_ids":["https://openalex.org/I27837315"]},{"raw_affiliation_string":"Electrical Engineering and Computer Science Department, University of Michigan, Ann Arbor, MI, USA","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046180915"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64576999,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"123","issue":null,"first_page":"586","last_page":"590"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9991000294685364,"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9934999942779541,"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/decoding-methods","display_name":"Decoding methods","score":0.7699779868125916},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6805366277694702},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.6493719220161438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5945367813110352},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5408706068992615},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.49536120891571045},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.47872281074523926},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4687246084213257},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.4574029743671417},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.45297709107398987},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4346977472305298},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4201241731643677},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.41299155354499817},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.398219496011734},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.3815177083015442},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37022095918655396},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12658318877220154},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.12340912222862244}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7699779868125916},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6805366277694702},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.6493719220161438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5945367813110352},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5408706068992615},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.49536120891571045},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.47872281074523926},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4687246084213257},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4574029743671417},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.45297709107398987},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4346977472305298},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4201241731643677},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.41299155354499817},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.398219496011734},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3815177083015442},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37022095918655396},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12658318877220154},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.12340912222862244},{"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/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2009.5205692","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205692","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.3481","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.3481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.umich.edu/~anastas/docs/isit09_ba_final_extended.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W79265410","https://openalex.org/W1536930200","https://openalex.org/W1886640579","https://openalex.org/W1943431639","https://openalex.org/W1968626661","https://openalex.org/W1996680908","https://openalex.org/W2015028593","https://openalex.org/W2029712200","https://openalex.org/W2049608049","https://openalex.org/W2070432296","https://openalex.org/W2105393329","https://openalex.org/W2111604404","https://openalex.org/W2114449874","https://openalex.org/W2115228681","https://openalex.org/W2117898372","https://openalex.org/W2119281313","https://openalex.org/W2120636752","https://openalex.org/W2121606987","https://openalex.org/W2125992207","https://openalex.org/W2127323309","https://openalex.org/W2128392432","https://openalex.org/W2128765501","https://openalex.org/W2136307214","https://openalex.org/W2137787303","https://openalex.org/W2141021549","https://openalex.org/W2141595086","https://openalex.org/W2141859951","https://openalex.org/W2142901448","https://openalex.org/W2146712141","https://openalex.org/W2146774798","https://openalex.org/W2147163807","https://openalex.org/W2148424897","https://openalex.org/W2148578757","https://openalex.org/W2151961505","https://openalex.org/W2156595614","https://openalex.org/W2156938362","https://openalex.org/W2158669549","https://openalex.org/W2163619651","https://openalex.org/W2163635118","https://openalex.org/W2163706521","https://openalex.org/W2163750149","https://openalex.org/W2165573107","https://openalex.org/W2165808853","https://openalex.org/W2169732368","https://openalex.org/W2206295654","https://openalex.org/W2539356408","https://openalex.org/W2987657883","https://openalex.org/W3099994871","https://openalex.org/W4238661777","https://openalex.org/W4251984466","https://openalex.org/W4256648168","https://openalex.org/W4300188436","https://openalex.org/W6681933419","https://openalex.org/W6682094878","https://openalex.org/W6683202485"],"related_works":["https://openalex.org/W2583282232","https://openalex.org/W2028268383","https://openalex.org/W2372190485","https://openalex.org/W2538179194","https://openalex.org/W2739456797","https://openalex.org/W3103136794","https://openalex.org/W2991327005","https://openalex.org/W3098001956","https://openalex.org/W2972577883","https://openalex.org/W2987150391"],"abstract_inverted_index":{"Codes":[0],"on":[1,27,38,72,115,127,134,180,187],"sparse":[2,39,73,135,181],"graphs":[3,40,74,136,182],"have":[4,75],"been":[5,57,76],"shown":[6],"to":[7,78,161,176,212],"achieve":[8,42,79,138,162,207],"remarkable":[9],"performance":[10],"in":[11,22],"point-to-point":[12],"channels":[13,47,86,109],"with":[14,48,87,123,152],"low":[15],"decoding":[16,50,98],"complexity.":[17],"Most":[18],"of":[19,35,45,82,120,144,178],"the":[20,43,63,68,80,116,139,148,165,188,208,213,220],"results":[21],"this":[23,102],"area":[24],"are":[25],"based":[26],"experimental":[28],"evidence":[29],"and/or":[30],"approximate":[31],"analysis.":[32],"The":[33],"question":[34],"whether":[36],"codes":[37,71,133,179],"can":[41,137,206],"capacity":[44,81],"noisy":[46],"iterative":[49],"is":[51,99,147],"still":[52],"open,":[53],"and":[54,59,154,217],"has":[55],"only":[56],"conclusively":[58],"positively":[60],"answered":[61],"for":[62,197],"binary":[64],"erasure":[65],"channel.":[66],"On":[67],"other":[69],"hand,":[70],"proven":[77],"memoryless,":[83],"binary-input,":[84],"output-symmetric":[85],"finite":[88],"graphical":[89],"complexity":[90],"per":[91],"information":[92,141,209],"bit":[93],"when":[94,174],"maximum":[95,149],"likelihood":[96],"(ML)":[97],"performed.":[100],"In":[101,159],"paper,":[103],"we":[104,130,167,202],"consider":[105,168],"transmission":[106],"over":[107],"finite-state":[108],"(FSCs).":[110],"We":[111],"derive":[112],"upper":[113],"bounds":[114,129,196],"average":[117,193],"error":[118,194],"probability":[119,195],"code":[121,200],"ensembles":[122,177],"ML":[124],"decoding.":[125],"Based":[126],"these":[128,198],"show":[131],"that":[132,173,204],"symmetric":[140],"rate":[142,151],"(SIR)":[143],"FSCs,":[145],"which":[146],"achievable":[150],"independently":[153],"uniformly":[155],"distributed":[156],"input":[157],"sequences.":[158],"order":[160],"rates":[163,210],"beyond":[164],"SIR,":[166],"a":[169,184],"simple":[170],"quantization":[171],"scheme":[172],"applied":[175],"induces":[183],"Markov":[185,215],"distribution":[186],"transmitted":[189],"sequence.":[190],"By":[191],"deriving":[192],"quantized":[199],"ensembles,":[201],"prove":[203],"they":[205],"corresponding":[211],"induced":[214],"distribution,":[216],"thus":[218],"approach":[219],"FSC":[221],"capacity.":[222]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}