{"id":"https://openalex.org/W2108147365","doi":"https://doi.org/10.1109/isit.2011.6033699","title":"An efficient algorithm for finding dominant trapping sets of irregular LDPC codes","display_name":"An efficient algorithm for finding dominant trapping sets of irregular LDPC codes","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2108147365","doi":"https://doi.org/10.1109/isit.2011.6033699","mag":"2108147365"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6033699","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","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":null,"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","Dept. of Systems and Computer Eng., Carleton University, Ottawa, Ontario, 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":"Dept. of Systems and Computer Eng., Carleton University, Ottawa, Ontario, 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","Dept. of Systems and Computer Eng., Carleton University, Ottawa, Ontario, 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":"Dept. of Systems and Computer Eng., Carleton University, Ottawa, Ontario, 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":2.9258,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.91335888,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1091","last_page":"1095"},"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.9980000257492065,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9661999940872192,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9236416816711426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7086061239242554},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6404421925544739},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5312107801437378},{"id":"https://openalex.org/keywords/trapping","display_name":"Trapping","score":0.5116119980812073},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5071563720703125},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49300476908683777},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.36901217699050903},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36552149057388306}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9236416816711426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7086061239242554},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6404421925544739},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5312107801437378},{"id":"https://openalex.org/C2777924906","wikidata":"https://www.wikidata.org/wiki/Q34168","display_name":"Trapping","level":2,"score":0.5116119980812073},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5071563720703125},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49300476908683777},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.36901217699050903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36552149057388306},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2011.6033699","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033699","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6299999952316284}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1772907943","https://openalex.org/W1964402820","https://openalex.org/W1996226010","https://openalex.org/W1998242373","https://openalex.org/W2035769530","https://openalex.org/W2045750430","https://openalex.org/W2054540803","https://openalex.org/W2118012216","https://openalex.org/W2122703296","https://openalex.org/W2127490352","https://openalex.org/W2136204051","https://openalex.org/W2137892166","https://openalex.org/W2142818093","https://openalex.org/W2553702736","https://openalex.org/W2964312726","https://openalex.org/W6638033105","https://openalex.org/W6652277478","https://openalex.org/W6659233878"],"related_works":["https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2047069332","https://openalex.org/W2352157218","https://openalex.org/W2806845321","https://openalex.org/W4293418541","https://openalex.org/W2393084694","https://openalex.org/W4213381250","https://openalex.org/W4309132699","https://openalex.org/W4386075170"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"an":[3],"efficient":[4],"algorithm":[5,19,49,91,160],"for":[6,169],"finding":[7],"the":[8,25,37,74,96,100,108,126,134,149,154,159,165],"dominant":[9,84,104,137,170],"trapping":[10,85,105,138,171],"sets":[11,86,106,139],"of":[12,28,36,55,87,99,103,110,129,136,153],"irregular":[13,29,41],"low-density":[14],"parity-check":[15],"(LDPC)":[16],"codes.":[17],"The":[18,48,76,90],"can":[20],"be":[21,34],"used":[22],"to":[23,33,39,83,113],"estimate":[24],"error":[26,46],"floor":[27],"LDPC":[30,42,146],"codes":[31,43,147],"or":[32],"part":[35],"apparatus":[38],"design":[40],"with":[44,52,60,65,121],"low":[45,61,66,122],"floors.":[47],"is":[50,92,140,161],"initiated":[51],"a":[53],"set":[54],"short":[56,114],"cycles,":[57,115],"variable":[58,117,131],"nodes":[59,118,132],"degree,":[62],"and":[63,107,119,151],"cycles":[64,120],"approximate":[67],"cycle":[68],"extrinsic":[69],"message":[70],"degree":[71],"(ACE),":[72],"as":[73],"input.":[75],"input":[77],"structures":[78,112],"are":[79],"then":[80],"expanded":[81],"recursively":[82],"increasing":[88],"size.":[89],"devised":[93],"based":[94],"on":[95,144],"careful":[97],"inspection":[98],"graphical":[101],"structure":[102,135],"relationship":[109],"such":[111],"low-degree":[116],"ACE.":[123],"In":[124,157],"particular,":[125,158],"important":[127],"role":[128],"degree-2":[130],"in":[133],"discussed.":[141],"Simulation":[142],"results":[143],"several":[145],"demonstrate":[148],"accuracy":[150],"efficiency":[152],"proposed":[155],"algorithm.":[156],"significantly":[162],"faster":[163],"than":[164],"existing":[166],"search":[167],"algorithms":[168],"sets.":[172]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}