{"id":"https://openalex.org/W2008209264","doi":"https://doi.org/10.1109/tit.2012.2205663","title":"Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes","display_name":"Efficient Algorithm for Finding Dominant Trapping Sets of LDPC Codes","publication_year":2012,"publication_date":"2012-08-03","ids":{"openalex":"https://openalex.org/W2008209264","doi":"https://doi.org/10.1109/tit.2012.2205663","mag":"2008209264"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2205663","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2205663","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/A5100800724","display_name":"Mehdi Karimi","orcid":null},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mehdi Karimi","raw_affiliation_strings":["Department of Systems and Computer Engineering, Carleton University, Ottawa, ONT, Canada","Department of Systems and Computer Engineering, Carleton University Ottawa, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems and Computer Engineering, Carleton University, Ottawa, ONT, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"Department of Systems and Computer Engineering, Carleton University Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046274917","display_name":"Amir H. Banihashemi","orcid":"https://orcid.org/0000-0003-0685-5256"},"institutions":[{"id":"https://openalex.org/I67031392","display_name":"Carleton University","ror":"https://ror.org/02qtvee93","country_code":"CA","type":"education","lineage":["https://openalex.org/I67031392"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Amir H. Banihashemi","raw_affiliation_strings":["Department of Systems and Computer Engineering, Carleton University, Ottawa, ONT, Canada","Department of Systems and Computer Engineering, Carleton University Ottawa, ON, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Systems and Computer Engineering, Carleton University, Ottawa, ONT, Canada","institution_ids":["https://openalex.org/I67031392"]},{"raw_affiliation_string":"Department of Systems and Computer Engineering, Carleton University Ottawa, ON, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":10.8094,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.98551452,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"58","issue":"11","first_page":"6942","last_page":"6958"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9957000017166138,"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"}},{"id":"https://openalex.org/T12029","display_name":"DNA and Biological Computing","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9404265880584717},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7305786609649658},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6127938032150269},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.611578643321991},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5058864951133728},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.4913386404514313},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.46658092737197876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4398975074291229},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43971094489097595},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.42759278416633606},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.42592817544937134},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.3766838312149048},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35112810134887695},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3003436326980591}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9404265880584717},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7305786609649658},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6127938032150269},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.611578643321991},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5058864951133728},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4913386404514313},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.46658092737197876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4398975074291229},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43971094489097595},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.42759278416633606},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.42592817544937134},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.3766838312149048},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35112810134887695},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3003436326980591},{"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/tit.2012.2205663","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2205663","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":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W152471750","https://openalex.org/W1484692004","https://openalex.org/W1542197380","https://openalex.org/W1555985201","https://openalex.org/W1577660440","https://openalex.org/W1588943481","https://openalex.org/W1772907943","https://openalex.org/W1964402820","https://openalex.org/W1982692217","https://openalex.org/W1996226010","https://openalex.org/W2001732758","https://openalex.org/W2015066643","https://openalex.org/W2032128222","https://openalex.org/W2035769530","https://openalex.org/W2054540803","https://openalex.org/W2054649237","https://openalex.org/W2095882513","https://openalex.org/W2111895369","https://openalex.org/W2111942381","https://openalex.org/W2114074598","https://openalex.org/W2115193201","https://openalex.org/W2118012216","https://openalex.org/W2118420528","https://openalex.org/W2119017156","https://openalex.org/W2122703296","https://openalex.org/W2127490352","https://openalex.org/W2129067428","https://openalex.org/W2135729755","https://openalex.org/W2136204051","https://openalex.org/W2136779851","https://openalex.org/W2142415334","https://openalex.org/W2142818093","https://openalex.org/W2147861990","https://openalex.org/W2151875415","https://openalex.org/W2153344955","https://openalex.org/W2154287427","https://openalex.org/W2154663979","https://openalex.org/W2156541068","https://openalex.org/W2156660752","https://openalex.org/W2166478505","https://openalex.org/W2553702736","https://openalex.org/W2963637485","https://openalex.org/W4285719527","https://openalex.org/W6606175091","https://openalex.org/W6628810906","https://openalex.org/W6659233878","https://openalex.org/W6679917997"],"related_works":["https://openalex.org/W2030180258","https://openalex.org/W4303096056","https://openalex.org/W26187695","https://openalex.org/W1493544699","https://openalex.org/W2127562763","https://openalex.org/W2153118538","https://openalex.org/W2350834058","https://openalex.org/W1972501090","https://openalex.org/W2139164285","https://openalex.org/W2071918243"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3,150],"efficient":[4],"algorithm":[5,19,47,108,138,214],"for":[6,149,191,223],"finding":[7],"the":[8,25,46,57,86,104,107,110,113,121,142,177,183,203,208,213,219],"dominant":[9,97,117,224],"trapping":[10,98,118,172,225],"sets":[11,99,119,169],"of":[12,28,53,100,106,112,116,123,163,179,207],"a":[13,33,51,161],"low-density":[14],"parity-check":[15],"(LDPC)":[16],"code.":[17],"The":[18,89,137],"can":[20,146,156],"be":[21,147,157],"used":[22,84,148],"to":[23,35,64,96,126,159,175],"estimate":[24],"error":[26,41,184],"floor":[27,185],"LDPC":[29,37,180,200],"codes":[30,38,181,201],"or":[31],"as":[32,56,85,167],"tool":[34],"design":[36],"with":[39,50,69,74,134],"low":[40,70,75,135],"floors.":[42],"For":[43,59],"regular":[44],"codes,":[45,61],"is":[48,139,215],"initiated":[49],"set":[52],"short":[54,65,127],"cycles":[55,73,133],"input.":[58],"irregular":[60],"in":[62,141,182],"addition":[63],"cycles,":[66,128],"variable":[67,130],"nodes":[68],"degree":[71,80],"and":[72,120,132,153,170,190,205],"approximate":[76],"cycle":[77],"extrinsic":[78],"message":[79],"(ACE)":[81],"are":[82,92],"also":[83],"initial":[87,90],"inputs.":[88],"inputs":[91],"then":[93],"expanded":[94],"recursively":[95],"increasing":[101],"size.":[102],"At":[103],"core":[105],"lies":[109],"analysis":[111],"graphical":[114,164],"structure":[115],"relationship":[122],"such":[124,166],"structures":[125],"low-degree":[129],"nodes,":[131],"ACE.":[136],"universal":[140],"sense":[143],"that":[144,154],"it":[145,155],"arbitrary":[151],"graph":[152],"tailored":[158],"find":[160],"variety":[162],"objects,":[165],"absorbing":[168],"Zyablov-Pinsker":[171],"sets,":[173],"known":[174],"dominate":[176],"performance":[178],"region":[186],"over":[187],"different":[188,192],"channels":[189],"iterative":[193],"decoding":[194],"algorithms.":[195],"Simulation":[196],"results":[197],"on":[198],"several":[199],"demonstrate":[202],"accuracy":[204],"efficiency":[206],"proposed":[209],"algorithm.":[210],"In":[211],"particular,":[212],"significantly":[216],"faster":[217],"than":[218],"existing":[220],"search":[221],"algorithms":[222],"sets.":[226]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}