{"id":"https://openalex.org/W1660863316","doi":"https://doi.org/10.1109/isit.2015.7282487","title":"Impact of redundant checks on the LP decoding thresholds of LDPC codes","display_name":"Impact of redundant checks on the LP decoding thresholds of LDPC codes","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1660863316","doi":"https://doi.org/10.1109/isit.2015.7282487","mag":"1660863316"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","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/A5003193872","display_name":"Louay Bazzi","orcid":"https://orcid.org/0000-0001-9859-3112"},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":true,"raw_author_name":"Louay Bazzi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon","[Dept. of Electrical and Computer Engineering, American University of Beirut, Lebanon]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]},{"raw_affiliation_string":"[Dept. of Electrical and Computer Engineering, American University of Beirut, Lebanon]","institution_ids":["https://openalex.org/I98635879"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039285852","display_name":"Hani Audah","orcid":null},"institutions":[{"id":"https://openalex.org/I98635879","display_name":"American University of Beirut","ror":"https://ror.org/04pznsd21","country_code":"LB","type":"education","lineage":["https://openalex.org/I98635879"]}],"countries":["LB"],"is_corresponding":false,"raw_author_name":"Hani Audah","raw_affiliation_strings":["Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon","[Dept. of Electrical and Computer Engineering, American University of Beirut, Lebanon]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, American University of Beirut, Beirut, Lebanon","institution_ids":["https://openalex.org/I98635879"]},{"raw_affiliation_string":"[Dept. of Electrical and Computer Engineering, American University of Beirut, Lebanon]","institution_ids":["https://openalex.org/I98635879"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5003193872"],"corresponding_institution_ids":["https://openalex.org/I98635879"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04821584,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"411","last_page":"415"},"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.9973000288009644,"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.9944999814033508,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7277905344963074},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6897043585777283},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6278340220451355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6269899606704712},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5476644039154053},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4956449270248413},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4750882685184479},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4597592055797577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4540676474571228},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40266644954681396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33164483308792114},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21358996629714966},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.14164498448371887},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07562819123268127}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7277905344963074},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6897043585777283},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6278340220451355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6269899606704712},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5476644039154053},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4956449270248413},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4750882685184479},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4597592055797577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4540676474571228},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40266644954681396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33164483308792114},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21358996629714966},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.14164498448371887},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07562819123268127},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2015.7282487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282487","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W193818406","https://openalex.org/W1537344883","https://openalex.org/W1588943481","https://openalex.org/W1950075816","https://openalex.org/W1970907073","https://openalex.org/W1987847892","https://openalex.org/W1993508000","https://openalex.org/W2031302740","https://openalex.org/W2033546746","https://openalex.org/W2052822863","https://openalex.org/W2078633872","https://openalex.org/W2097981865","https://openalex.org/W2101011172","https://openalex.org/W2115769160","https://openalex.org/W2117404317","https://openalex.org/W2126256086","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2151551808","https://openalex.org/W2169134868","https://openalex.org/W2949560198","https://openalex.org/W4285719527","https://openalex.org/W6607773459","https://openalex.org/W6632343532","https://openalex.org/W6635197353","https://openalex.org/W6640819653","https://openalex.org/W6642983288","https://openalex.org/W6658471458"],"related_works":["https://openalex.org/W1968533815","https://openalex.org/W2808439818","https://openalex.org/W2126464345","https://openalex.org/W4386075170","https://openalex.org/W4309132699","https://openalex.org/W2150639697","https://openalex.org/W2351144917","https://openalex.org/W2090897912","https://openalex.org/W2142415334","https://openalex.org/W2125154953"],"abstract_inverted_index":{"Feldman":[0,222],"et":[1,223],"al.":[2,224],"[1]":[3],"asked":[4],"whether":[5],"the":[6,9,24,50,55,64,73,97,103,106,110,128,131,151,165,183,186,191,196,207,210,258,262,278,285,288,294,306],"performance":[7],"of":[8,105,130,138,156,185,203,209,250,265,268,331],"Linear":[10],"Programming":[11],"(LP)":[12],"decoder":[13,52,108,133,198],"can":[14],"be":[15],"improved":[16],"by":[17,144,230],"adding":[18,149,310],"redundant":[19,41,93,136,154,178],"parity":[20,42,94],"checks":[21,95,137,155,179,315],"to":[22,150,275,282,305],"tighten":[23],"LP":[25,51,98,107,132,152,197],"relaxation.":[26],"We":[27,161,189,244,256,323],"prove":[28],"in":[29,49,96,109,253],"this":[30],"paper":[31],"that":[32,71,127,163,235,287,309,325],"for":[33,113],"LDPC":[34],"codes,":[35],"even":[36,205],"if":[37,72,164,195,206,261],"we":[38,69,85,172,233],"include":[39],"all":[40,135,153,177],"checks,":[43],"asymptotically":[44,193],"there":[45,119],"is":[46,120,291,298,303,327],"no":[47],"gain":[48],"threshold":[53,104,129,184],"on":[54,63,218],"Binary":[56],"Symmetric":[57],"Channel":[58],"(BSC)":[59],"under":[60],"certain":[61],"conditions":[62],"base":[65,74,187],"Tanner":[66,75,334],"graph.":[67],"First,":[68],"show":[70,234],"graph":[76,166,192,259,289],"has":[77],"bounded":[78],"check-degree":[79],"and":[80,226,293],"satisfies":[81,167],"a":[82,121,200,219,247,266,272,319,328],"condition":[83,170],"which":[84,171],"call":[86,173,190,257],"asymptotic":[87,236,251],"strength,":[88],"then":[89,175],"including":[90,176],"high":[91],"degree":[92,139,157,297],"does":[99,180,316],"not":[100,181,317],"significantly":[101],"improve":[102,182],"following":[111],"sense:":[112],"each":[114],"constant":[115,122,201,320],"\u03b4":[116,147],">":[117,124],"0,":[118],"k":[123,142],"0":[125],"such":[126],"containing":[134],"at":[140,145,299,311],"most":[141,146],"improves":[143],"upon":[148],"larger":[158],"than":[159],"k.":[160],"conclude":[162],"an":[168],"additional":[169],"rigidity,":[174],"LP.":[188],"strong":[194],"corrects":[199],"fraction":[202],"errors":[204],"log-likelihood-ratios":[208],"correct":[211],"variables":[212],"are":[213],"arbitrarily":[214],"small.":[215],"By":[216],"building":[217],"construction":[220],"due":[221],"[2]":[225],"its":[227],"recent":[228],"improvement":[229],"Viderman":[231],"[3],":[232],"strength":[237,252],"follows":[238],"from":[239],"sufficiently":[240],"large":[241],"variable-to-check":[242],"expansion.":[243],"also":[245],"give":[246,318],"geometric":[248],"interpretation":[249],"terms":[254],"pseudocodewords.":[255],"rigid":[260],"minimum":[263,295],"weight":[264,321],"sum":[267],"check":[269,296],"nodes":[270],"involving":[271],"cycle":[273],"tends":[274,281],"infinity":[276],"as":[277],"block":[279],"length":[280],"infinity.":[283],"Under":[284],"assumptions":[286],"girth":[290],"logarithmic":[292],"least":[300,312],"3,":[301],"rigidity":[302],"equivalent":[304],"nondegeneracy":[307,326],"property":[308,330],"logarithmically":[313],"many":[314],"check.":[322],"argue":[324],"typical":[329],"random":[332],"check-regular":[333],"graphs.":[335]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}