{"id":"https://openalex.org/W2167193997","doi":"https://doi.org/10.1109/isit.2010.5513612","title":"LP decoding of regular LDPC codes in memoryless channels","display_name":"LP decoding of regular LDPC codes in memoryless channels","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2167193997","doi":"https://doi.org/10.1109/isit.2010.5513612","mag":"2167193997"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","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/A5109588180","display_name":"Nissim Halabi","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Nissim Halabi","raw_affiliation_strings":["School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064059676","display_name":"Guy Even","orcid":"https://orcid.org/0000-0001-5407-330X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Guy Even","raw_affiliation_strings":["School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Tel-Aviv University, Tel-Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.7603,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.85694306,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"744","last_page":"748"},"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.9983999729156494,"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.9911999702453613,"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.8661054372787476},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7030483484268188},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6182383298873901},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5761989951133728},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5533230900764465},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5294123888015747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5119479894638062},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.4732677936553955},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.46190720796585083},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4486334025859833},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.43553832173347473},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.4142068028450012},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.41261059045791626},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34172624349594116},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3327934741973877},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07328984141349792},{"id":"https://openalex.org/keywords/white-noise","display_name":"White noise","score":0.0680525004863739}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8661054372787476},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7030483484268188},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6182383298873901},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5761989951133728},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5533230900764465},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5294123888015747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5119479894638062},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.4732677936553955},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.46190720796585083},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4486334025859833},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.43553832173347473},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.4142068028450012},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.41261059045791626},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34172624349594116},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3327934741973877},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07328984141349792},{"id":"https://openalex.org/C112633086","wikidata":"https://www.wikidata.org/wiki/Q381287","display_name":"White noise","level":2,"score":0.0680525004863739},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1537344883","https://openalex.org/W1588943481","https://openalex.org/W1970907073","https://openalex.org/W1993508000","https://openalex.org/W2019441424","https://openalex.org/W2033546746","https://openalex.org/W2109489513","https://openalex.org/W2114364830","https://openalex.org/W2128297707","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2141975070","https://openalex.org/W2156938362","https://openalex.org/W2167193997","https://openalex.org/W2169134868","https://openalex.org/W2169732368","https://openalex.org/W2949560198","https://openalex.org/W2962897197","https://openalex.org/W3105513639","https://openalex.org/W6632343532","https://openalex.org/W6635197353","https://openalex.org/W6642983288","https://openalex.org/W6658471458"],"related_works":["https://openalex.org/W2121777163","https://openalex.org/W2061476814","https://openalex.org/W2171564636","https://openalex.org/W2157055070","https://openalex.org/W1594757504","https://openalex.org/W2159839982","https://openalex.org/W2534707225","https://openalex.org/W1504657239","https://openalex.org/W2101828326","https://openalex.org/W99853930"],"abstract_inverted_index":{"We":[0],"study":[1],"error":[2,23],"bounds":[3,19,44],"for":[4,48],"linear":[5],"programming":[6],"decoding":[7],"of":[8,32,61,68],"regular":[9,49],"LDPC":[10,50,71],"codes.":[11],"For":[12,36],"memoryless":[13,37],"binary-input":[14,38],"output-symmetric":[15],"channels,":[16,40],"we":[17,41,56],"prove":[18,57],"on":[20,45,65],"the":[21,30,33,46,66],"word":[22],"probability":[24],"that":[25],"are":[26],"inverse":[27],"doubly-exponential":[28],"in":[29],"girth":[31],"factor":[34],"graph.":[35],"AWGN":[39],"derive":[42],"lower":[43,59],"thresholds":[47],"codes":[51,72],"under":[52],"LP":[53],"decoding.":[54],"Specifically,":[55],"a":[58],"bound":[60],"\u03c3":[62],"=":[63],"0.735":[64],"threshold":[67],"(3,":[69],"6)-regular":[70],"with":[73],"logarithmic":[74],"girth.":[75]},"counts_by_year":[{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}