{"id":"https://openalex.org/W3153468095","doi":"https://doi.org/10.1109/jsait.2021.3073834","title":"Belief Propagation Decoding of Short Graph-Based Channel Codes via Reinforcement Learning","display_name":"Belief Propagation Decoding of Short Graph-Based Channel Codes via Reinforcement Learning","publication_year":2021,"publication_date":"2021-04-16","ids":{"openalex":"https://openalex.org/W3153468095","doi":"https://doi.org/10.1109/jsait.2021.3073834","mag":"3153468095"},"language":"en","primary_location":{"id":"doi:10.1109/jsait.2021.3073834","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2021.3073834","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"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 Journal on Selected Areas in 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/A5073928240","display_name":"Salman Habib","orcid":"https://orcid.org/0000-0003-0699-5312"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Salman Habib","raw_affiliation_strings":["New Jersey Institute of Technology, Newark, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0003-0699-5312","affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology, Newark, NJ, USA","institution_ids":["https://openalex.org/I118118575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012036098","display_name":"Allison Beemer","orcid":"https://orcid.org/0000-0002-1759-5026"},"institutions":[{"id":"https://openalex.org/I124727415","display_name":"University of Wisconsin\u2013Eau Claire","ror":"https://ror.org/03mnm0t94","country_code":"US","type":"education","lineage":["https://openalex.org/I124727415"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Allison Beemer","raw_affiliation_strings":["University of Wisconsin-Eau Claire, Eau Claire, WI, USA"],"raw_orcid":"https://orcid.org/0000-0002-1759-5026","affiliations":[{"raw_affiliation_string":"University of Wisconsin-Eau Claire, Eau Claire, WI, USA","institution_ids":["https://openalex.org/I124727415"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021311010","display_name":"J\u00f6rg Kliewer","orcid":"https://orcid.org/0000-0003-0942-8006"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jorg Kliewer","raw_affiliation_strings":["New Jersey Institute of Technology, Newark, NJ, USA"],"raw_orcid":"https://orcid.org/0000-0003-0942-8006","affiliations":[{"raw_affiliation_string":"New Jersey Institute of Technology, Newark, NJ, USA","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7637,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.85141649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"2","issue":"2","first_page":"627","last_page":"640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9998000264167786,"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.9918000102043152,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9902999997138977,"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/computer-science","display_name":"Computer science","score":0.7484972476959229},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6565464735031128},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6034928560256958},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5718027949333191},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.5313632488250732},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5308177471160889},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5208233594894409},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.49200984835624695},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.4633252024650574},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4396286904811859},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4286058843135834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42195045948028564},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.33492714166641235},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.31592369079589844},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3147258162498474},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.19420120120048523},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17930492758750916},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16262105107307434},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1291247010231018}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7484972476959229},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6565464735031128},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6034928560256958},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5718027949333191},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.5313632488250732},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5308177471160889},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5208233594894409},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.49200984835624695},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4633252024650574},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4396286904811859},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4286058843135834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42195045948028564},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.33492714166641235},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.31592369079589844},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3147258162498474},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.19420120120048523},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17930492758750916},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16262105107307434},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1291247010231018}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/jsait.2021.3073834","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jsait.2021.3073834","pdf_url":null,"source":{"id":"https://openalex.org/S4210211895","display_name":"IEEE Journal on Selected Areas in Information Theory","issn_l":"2641-8770","issn":["2641-8770"],"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 Journal on Selected Areas in Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G1776033491","display_name":null,"funder_award_id":"ECCS-1711056","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6856519187","display_name":null,"funder_award_id":"W911NF-17-2-0183","funder_id":"https://openalex.org/F4320338295","funder_display_name":"Army Research Laboratory"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320338295","display_name":"Army Research Laboratory","ror":"https://ror.org/011hc8f90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W41554520","https://openalex.org/W146031494","https://openalex.org/W1516061453","https://openalex.org/W1607198972","https://openalex.org/W1634005169","https://openalex.org/W1640719368","https://openalex.org/W2017687288","https://openalex.org/W2021004298","https://openalex.org/W2071304218","https://openalex.org/W2090170171","https://openalex.org/W2109489513","https://openalex.org/W2114869758","https://openalex.org/W2121863487","https://openalex.org/W2123530431","https://openalex.org/W2126259959","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2134502194","https://openalex.org/W2158548602","https://openalex.org/W2160808139","https://openalex.org/W2170998175","https://openalex.org/W2666368276","https://openalex.org/W2949164659","https://openalex.org/W2963007936","https://openalex.org/W2963488874","https://openalex.org/W2964138646","https://openalex.org/W2970789498","https://openalex.org/W2989864352","https://openalex.org/W3011120880","https://openalex.org/W3080145170","https://openalex.org/W3099197037","https://openalex.org/W3100717665","https://openalex.org/W3125634603","https://openalex.org/W3130019250","https://openalex.org/W3130968093","https://openalex.org/W3140968660","https://openalex.org/W3205648037","https://openalex.org/W4206547457","https://openalex.org/W4287642324","https://openalex.org/W4288114397","https://openalex.org/W6631277298","https://openalex.org/W6683443546","https://openalex.org/W6748232849","https://openalex.org/W6767660367","https://openalex.org/W6775686901","https://openalex.org/W6784337479"],"related_works":["https://openalex.org/W4385859070","https://openalex.org/W4380030966","https://openalex.org/W1978153242","https://openalex.org/W2118148379","https://openalex.org/W2153768812","https://openalex.org/W2594313860","https://openalex.org/W4290466155","https://openalex.org/W2167340446","https://openalex.org/W2992200486","https://openalex.org/W2159021452"],"abstract_inverted_index":{"In":[0,112,154],"this":[1],"work,":[2],"we":[3,18,160,238],"consider":[4],"the":[5,32,55,61,72,81,135,139,170,174,192,203,209,214,243],"decoding":[6,106,189,204,210,244,250],"of":[7,34,60,173,195],"short":[8],"sparse":[9],"graph-based":[10],"channel":[11],"codes":[12,47],"via":[13,51,63,101],"reinforcement":[14],"learning":[15],"(RL).":[16],"Specifically,":[17],"focus":[19],"on":[20,54,234],"low-density":[21],"parity-check":[22],"(LDPC)":[23],"codes,":[24],"which":[25,119,144,230],"for":[26],"example":[27],"have":[28],"been":[29],"standardized":[30],"in":[31,71,148,176,242],"context":[33],"5G":[35],"cellular":[36],"communication":[37],"systems":[38],"due":[39],"to":[40,103,110,121,137,156,168,187,247],"their":[41],"excellent":[42],"error":[43],"correcting":[44],"performance.":[45],"LDPC":[46,84,152,228,249],"are":[48,75,184],"typically":[49],"decoded":[50,232],"belief":[52],"propagation":[53],"corresponding":[56],"bipartite":[57],"(Tanner)":[58],"graph":[59,74],"code":[62,224,229],"flooding,":[64],"i.e.,":[65],"all":[66],"check":[67,96],"and":[68,93],"variable":[69],"nodes":[70],"Tanner":[73],"updated":[76],"at":[77],"once.":[78],"We":[79],"model":[80],"node-wise":[82],"sequential":[83,105,151],"scheduling":[85,99,133,142,215],"scheme":[86],"as":[87,108],"a":[88,126,162,178],"Markov":[89],"decision":[90],"process":[91],"(MDP),":[92],"obtain":[94],"optimized":[95,140],"node":[97],"(CN)":[98],"policies":[100],"RL":[102,114,158,198],"improve":[104,202],"performance":[107,245],"compared":[109,246],"flooding.":[111],"each":[113,130],"step,":[115],"an":[116,221,226],"agent":[117,136],"decides":[118],"CN":[120,141,165],"schedule":[122],"next":[123],"by":[124],"observing":[125],"reward":[127],"associated":[128],"with":[129,225],"choice.":[131],"Repeated":[132],"enables":[134],"discover":[138],"policy":[143,216],"is":[145,217,231],"later":[146],"incorporated":[147],"our":[149,196,235],"RL-based":[150],"decoder.":[153],"order":[155],"reduce":[157,208],"complexity,":[159],"propose":[161],"novel":[163],"graph-induced":[164],"clustering":[166],"approach":[167],"partition":[169],"state":[171],"space":[172],"MDP":[175],"such":[177],"way":[179],"that":[180],"dependencies":[181],"between":[182],"clusters":[183],"minimized.":[185],"Compared":[186],"standard":[188],"approaches":[190],"from":[191],"literature,":[193],"some":[194],"proposed":[197],"schemes":[199],"not":[200],"only":[201],"performance,":[205],"but":[206],"also":[207],"complexity":[211],"dramatically":[212],"once":[213],"learned.":[218],"By":[219],"concatenating":[220],"outer":[222],"Hamming":[223],"inner":[227],"based":[233],"learned":[236],"policy,":[237],"demonstrate":[239],"significant":[240],"improvements":[241],"other":[248],"policies.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}