{"id":"https://openalex.org/W2963479010","doi":"https://doi.org/10.1109/tit.2017.2678531","title":"LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes","display_name":"LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes","publication_year":2017,"publication_date":"2017-03-06","ids":{"openalex":"https://openalex.org/W2963479010","doi":"https://doi.org/10.1109/tit.2017.2678531","mag":"2963479010"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2017.2678531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2678531","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/A5016244525","display_name":"Badih Ghazi","orcid":"https://orcid.org/0000-0001-8254-3268"},"institutions":[{"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":"Badih Ghazi","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":"https://orcid.org/0000-0001-8254-3268","affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075423314","display_name":"Euiwoong Lee","orcid":"https://orcid.org/0000-0003-1454-7587"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4400600948","display_name":"Microsoft Research New England (United States)","ror":"https://ror.org/010wkqn50","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Euiwoong Lee","raw_affiliation_strings":["Microsoft Research New England, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research New England, Cambridge, MA, USA","institution_ids":["https://openalex.org/I1290206253","https://openalex.org/I4400600948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.37730127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"64","issue":"6","first_page":"4423","last_page":"4437"},"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.9988999962806702,"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.9987000226974487,"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.6892185807228088},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4639883041381836},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46370038390159607},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.41536960005760193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38205093145370483},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37775135040283203}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6892185807228088},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4639883041381836},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46370038390159607},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41536960005760193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38205093145370483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37775135040283203}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2017.2678531","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2017.2678531","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/G1513559549","display_name":"Emerging Frontiers of Science of Information","funder_award_id":"CCF0-939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G717462885","display_name":"AF: Small: Local Computation Algorithms","funder_award_id":"1217423","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7513737132","display_name":"AF: Small: Some Frontiers in the Approximability of Constraint Satisfaction and Related Problems","funder_award_id":"1115525","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/F4320332195","display_name":"Samsung","ror":"https://ror.org/04w3jy968"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1485993952","https://openalex.org/W1536930200","https://openalex.org/W1607580485","https://openalex.org/W1993508000","https://openalex.org/W2002025272","https://openalex.org/W2031302740","https://openalex.org/W2033546746","https://openalex.org/W2049143039","https://openalex.org/W2052822863","https://openalex.org/W2068190866","https://openalex.org/W2077397558","https://openalex.org/W2095882513","https://openalex.org/W2107052785","https://openalex.org/W2114449874","https://openalex.org/W2115404728","https://openalex.org/W2122997342","https://openalex.org/W2126276563","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2139012746","https://openalex.org/W2151551808","https://openalex.org/W2159337637","https://openalex.org/W2163496715","https://openalex.org/W2169134868","https://openalex.org/W2169732368","https://openalex.org/W2185716868","https://openalex.org/W2293144562","https://openalex.org/W2514739098","https://openalex.org/W2949560198","https://openalex.org/W6636428886","https://openalex.org/W6658471458"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W4238204885"],"abstract_inverted_index":{"Random":[0],"(d\u03bd,":[1,153,192],"dc)-regular":[2,154,193],"low-density":[3],"paritycheck":[4],"(LDPC)":[5],"codes,":[6],"where":[7],"each":[8,17],"variable":[9],"is":[10,69,81,259,294],"involved":[11],"in":[12,212,266],"du":[13,163],"parity":[14,18],"checks":[15],"and":[16,106,157,164,202,242,273,303,385],"check":[19],"involves":[20],"dcvariables":[21],"are":[22,47,315],"well-known":[23],"to":[24,50,83,110,208,231,298,319,381,387],"achieve":[25],"the":[26,30,60,70,104,116,137,176,213,216,232,256,301,304,353],"Shannon":[27],"capacity":[28],"of":[29,56,59,76,88,99,128,134,136,148,162,168,173,175,187,215,218,234,245,264,271,285,291,306,312,323,340,350,352,377],"binary":[31],"symmetric":[32],"channel,":[33],"for":[34,125,159,221,240,250,255,330,356,373],"sufficiently":[35],"large":[36,321],"d\u03bdand":[37,129],"dc,":[38,130,169],"under":[39],"exponential":[40],"time":[41,45],"decoding.":[42],"However,":[43],"polynomial":[44],"algorithms":[46,64],"only":[48],"known":[49,82],"correct":[51,84,111,142,181],"a":[52,66,131,151,170,190,199,320,347,374],"much":[53,112],"smaller":[54],"fraction":[55,87,147,186],"errors.":[57,89],"One":[58],"most":[61],"powerful":[62,97],"polynomial-time":[63],"with":[65,278,363],"formal":[67],"analysis":[68],"linear":[71,132,171,348,375],"programming":[72],"(LP)":[73],"decoding":[74],"algorithm":[75],"Feldman":[77],"et":[78],"al.,":[79],"which":[80],"an":[85,145,184,336,365],"\u03a9(1/dc)":[86],"In":[90,119,328],"this":[91],"paper,":[92],"we":[93,121,334],"show":[94,122],"that":[95,205,282,295,344],"fairly":[96],"extensions":[98],"LP":[100,139],"decoding,":[101],"based":[102,260],"on":[103,150,189,261],"Sherali-Adams":[105,138,241],"Lasserre":[107,177,257,354],"hierarchies,":[108],"fail":[109],"more":[113,143,182,316],"errors":[114,149,188],"than":[115,144,183],"basic":[117],"LP-decoder.":[118],"particular,":[120,329],"that:":[123],"1)":[124],"any":[126,160,269,357],"values":[127,167],"number":[133,172,349,376],"rounds":[135,174,351,378],"hierarchy":[140,179,258],"cannot":[141,180],"O(1/dc)":[146,185],"random":[152,191,307],"LDPC":[155,194,309],"code;":[156],"2)":[158],"value":[161],"infinitely":[165],"many":[166],"SDP":[178],"code.":[195],"Our":[196,252],"proofs":[197],"use":[198],"new":[200],"stretching":[201],"collapsing":[203],"technique":[204],"allows":[206],"us":[207],"leverage":[209],"recent":[210],"progress":[211],"study":[214],"limitations":[217],"LP/SDP":[219],"hierarchies":[220],"Maximum":[222],"Constraint":[223],"Satisfaction":[224],"Problems":[225],"(Max-CSPs).":[226],"The":[227,369],"problem":[228],"then":[229],"reduces":[230],"construction":[233,254],"special":[235,243,279],"balanced":[236,246],"pairwise":[237,247],"independent":[238,248,286],"distributions":[239],"cosets":[244],"subgroups":[249],"Lasserre.":[251],"(algebraic)":[253],"designing":[262],"sets":[263],"points":[265],"Fqd(for":[267],"q":[268,360,364],"power":[270],"2":[272,382],"d":[274],"=":[275,359],"2,":[276],"3)":[277],"hyperplane-incidence":[280],"properties-constructions":[281],"may":[283],"be":[284,299],"interest.":[287],"An":[288],"intriguing":[289],"consequence":[290],"our":[292,313],"work":[293],"expansion":[296],"seems":[297],"both":[300],"strength":[302],"weakness":[305],"regular":[308],"codes.":[310],"Some":[311],"techniques":[314],"generally":[317],"applicable":[318],"class":[322],"Boolean":[324],"CSPs":[325],"called":[326],"Min-Ones.":[327],"k-Hypergraph":[331],"Vertex":[332],"Cover,":[333],"obtain":[335],"improved":[337],"integrality":[338],"gap":[339,372],"k":[341,358],"-1-":[342],"\u03b5":[343,384],"holds":[345],"after":[346],"hierarchy,":[355],"+":[361],"1":[362],"arbitrary":[366],"prime":[367],"power.":[368],"best":[370],"previous":[371],"was":[379],"equal":[380],"-":[383],"due":[386],"Schoenebeck.":[388]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}