{"id":"https://openalex.org/W2052822863","doi":"https://doi.org/10.1109/tit.2012.2208584","title":"Message-Passing Algorithms and Improved LP Decoding","display_name":"Message-Passing Algorithms and Improved LP Decoding","publication_year":2012,"publication_date":"2012-07-13","ids":{"openalex":"https://openalex.org/W2052822863","doi":"https://doi.org/10.1109/tit.2012.2208584","mag":"2052822863"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2208584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2208584","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/A5103209777","display_name":"Sanjeev Arora","orcid":"https://orcid.org/0000-0003-4852-691X"},"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":"Sanjeev Arora","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","Department of Computer Science, Princeton University, Princeton , NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton , NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034822411","display_name":"Constantinos Daskalakis","orcid":"https://orcid.org/0000-0002-5451-0490"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Constantinos Daskalakis","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","Dept. of Electr. Eng. & Comput. Sci.. MIT, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"Dept. of Electr. Eng. & Comput. Sci.. MIT, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089128021","display_name":"David Steurer","orcid":"https://orcid.org/0000-0002-3908-8180"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Steurer","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, NY, USA","[Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"[Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA]","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6306,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.93337306,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"58","issue":"12","first_page":"7260","last_page":"7271"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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.9987000226974487,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9983000159263611,"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.85953688621521},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7207643985748291},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7106755971908569},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6107597947120667},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.5936478972434998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5363256931304932},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5296197533607483},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4884113669395447},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3779889941215515},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.22084960341453552},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.13536879420280457}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.85953688621521},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7207643985748291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7106755971908569},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6107597947120667},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.5936478972434998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5363256931304932},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5296197533607483},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4884113669395447},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3779889941215515},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.22084960341453552},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.13536879420280457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2012.2208584","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2208584","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":[{"id":"https://openalex.org/G157525879","display_name":"New Directions in Semidefinite Programming and Approximation","funder_award_id":"0830673","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3295494632","display_name":null,"funder_award_id":"CCF-1101491","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4289525447","display_name":null,"funder_award_id":"CCF-0832797","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6715213848","display_name":"CAREER: Towards a Constructive Theory of Networked Interactions","funder_award_id":"0953960","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7285016336","display_name":"Collaborative Research: MSPA-MCS: Embeddings of Finite Metric Spaces - A Geometric Approach to Efficient Algorithms","funder_award_id":"0528414","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7461983665","display_name":"ICES: Small: A Probabilistic Look at Algorithmic Game Theory","funder_award_id":"1101491","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320309292","display_name":"Princeton University","ror":"https://ror.org/00hx57361"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W1537344883","https://openalex.org/W1993508000","https://openalex.org/W2049143039","https://openalex.org/W2067554595","https://openalex.org/W2068136251","https://openalex.org/W2127342417","https://openalex.org/W2127370988","https://openalex.org/W2129638195","https://openalex.org/W2139164285","https://openalex.org/W2140817291","https://openalex.org/W2141537014","https://openalex.org/W2150249649","https://openalex.org/W2169134868","https://openalex.org/W2169732368","https://openalex.org/W2176504112","https://openalex.org/W2293231900","https://openalex.org/W2541816912","https://openalex.org/W2949560198","https://openalex.org/W4205661203","https://openalex.org/W4300188436","https://openalex.org/W6632343532","https://openalex.org/W6681918002"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W1980817751","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2357077655"],"abstract_inverted_index":{"Linear":[0],"programming":[1],"(LP)":[2],"decoding":[3,32,52,164],"for":[4,63,87,127,153,229],"low-density":[5],"parity-check":[6],"codes":[7],"(and":[8],"related":[9],"domains":[10],"such":[11],"as":[12,93],"compressed":[13],"sensing)":[14],"has":[15],"received":[16],"increased":[17],"attention":[18],"over":[19],"recent":[20],"years":[21],"because":[22],"of":[23,30,45,55,60,71,73,90,104,113,124,137,182,188,222,240,250],"its":[24,34],"practical":[25],"performance-coming":[26],"close":[27,133],"to":[28,36,49,84,119,134,196,246],"that":[29,193,236],"iterative":[31,138],"algorithms-and":[33],"amenability":[35],"finite-blocklength":[37],"analysis.":[38],"Several":[39],"works":[40,62,173],"starting":[41],"with":[42,174],"the":[43,77,88,135,145,175,204,223,227,241],"work":[44,103],"Feldman":[46],"showed":[47],"how":[48],"analyze":[50],"LP":[51,114,154,163],"using":[53],"properties":[54],"expander":[56],"graphs.":[57],"This":[58],"line":[59],"analysis":[61,157,232],"only":[64],"low":[65],"error":[66,151],"rates,":[67],"about":[68],"a":[69,110,121,186,189,208,219,247],"couple":[70],"orders":[72],"magnitude":[74],"lower":[75],"than":[76,144],"empirically":[78],"observed":[79],"performance.":[80],"It":[81],"is":[82,141,185,203],"possible":[83],"do":[85],"better":[86],"case":[89],"random":[91],"noise,":[92],"shown":[94],"by":[95,218],"Daskalakis":[96],"and":[97,99,106,140,165],"Koetter":[98,105],"Vontobel.":[100],"Building":[101],"on":[102],"Vontobel,":[107],"we":[108,194],"obtain":[109],"novel":[111],"understanding":[112],"decoding,":[115],"which":[116],"allows":[117],"us":[118],"establish":[120],"0.05":[122,248],"fraction":[123,249],"correctable":[125,149],"errors":[126],"rate-\u00bd":[128],"codes;":[129],"this":[130,237],"comes":[131],"very":[132],"performance":[136],"decoders":[139],"significantly":[142],"higher":[143],"best":[146],"previously":[147],"noted":[148],"bit":[150],"rate":[152],"decoding.":[155],"Our":[156,231],"exploits":[158],"an":[159],"explicit":[160],"connection":[161],"between":[162],"message-passing":[166],"algorithms":[167],"and,":[168],"unlike":[169],"other":[170],"techniques,":[171],"directly":[172],"primal":[176],"linear":[177],"program.":[178],"An":[179],"interesting":[180],"byproduct":[181],"our":[183],"method":[184],"notion":[187],"\u201clocally":[190],"optimal\u201d":[191],"solution":[192,209],"show":[195],"always":[197],"be":[198,213],"globally":[199],"optimal":[200],"(i.e.,":[201],"it":[202],"nearest":[205],"codeword).":[206],"Such":[207],"can":[210],"in":[211,215,234],"fact":[212],"found":[214],"near-linear":[216],"time":[217],"\u201creweighted\u201d":[220],"version":[221,239],"min-sum":[224,242],"algorithm,":[225],"obviating":[226],"need":[228],"LP.":[230],"implies,":[233],"particular,":[235],"reweighted":[238],"decoder":[243],"corrects":[244],"up":[245],"errors.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}