{"id":"https://openalex.org/W2558776151","doi":"https://doi.org/10.1109/isit.2017.8006717","title":"Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes","display_name":"Characterization and efficient exhaustive search algorithm for elementary trapping sets of irregular LDPC codes","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2558776151","doi":"https://doi.org/10.1109/isit.2017.8006717","mag":"2558776151"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5080145492","display_name":"Yoones Hashemi","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":true,"raw_author_name":"Yoones Hashemi","raw_affiliation_strings":["Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Systems and Computer Engineering, 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, Ontario, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada","institution_ids":["https://openalex.org/I67031392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5080145492"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":2.4864,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.90395066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1192","last_page":"1196"},"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.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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9851999878883362,"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/characterization","display_name":"Characterization (materials science)","score":0.6982173323631287},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6845758557319641},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6173135042190552},{"id":"https://openalex.org/keywords/terminology","display_name":"Terminology","score":0.5782570242881775},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5637155175209045},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5416513085365295},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4924395978450775},{"id":"https://openalex.org/keywords/ranging","display_name":"Ranging","score":0.4727685749530792},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.4439810812473297},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3810306191444397},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.31413400173187256},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08715596795082092}],"concepts":[{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.6982173323631287},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6845758557319641},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6173135042190552},{"id":"https://openalex.org/C547195049","wikidata":"https://www.wikidata.org/wiki/Q1725664","display_name":"Terminology","level":2,"score":0.5782570242881775},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5637155175209045},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5416513085365295},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4924395978450775},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.4727685749530792},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.4439810812473297},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3810306191444397},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.31413400173187256},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08715596795082092},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8006717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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":5,"referenced_works":["https://openalex.org/W1964402820","https://openalex.org/W2008209264","https://openalex.org/W2009260494","https://openalex.org/W2471259433","https://openalex.org/W2521520100"],"related_works":["https://openalex.org/W4384112194","https://openalex.org/W2783354812","https://openalex.org/W2103009189","https://openalex.org/W4312958259","https://openalex.org/W4390813131","https://openalex.org/W2349383066","https://openalex.org/W4328132048","https://openalex.org/W4308259661","https://openalex.org/W1968289971","https://openalex.org/W4300588357"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,41,88,104,119,121],"characterization":[6,37,79],"of":[7,32,45,51,98,109,117,142],"elementary":[8],"trapping":[9],"sets":[10,19],"(ETSs)":[11],"for":[12,87],"irregular":[13,90],"low-density":[14],"parity-check":[15],"(LDPC)":[16],"codes.":[17,34],"These":[18],"are":[20,136],"known":[21],"to":[22,81,138,147,151],"be":[23,160],"the":[24,28,52,72,96,107,140,143,152],"main":[25],"culprits":[26],"in":[27,156],"error":[29],"floor":[30],"region":[31],"such":[33],"The":[35,76],"proposed":[36,77],"is":[38],"based":[39],"on":[40],"hierarchical":[42],"graphical":[43],"representation":[44],"ETSs,":[46],"starting":[47],"from":[48,55],"simple":[49,62],"cycles":[50],"graph,":[53],"or":[54],"single":[56],"variable":[57],"nodes,":[58],"and":[59,69,105,125,146],"involves":[60],"three":[61],"expansion":[63],"techniques:":[64],"depth-one":[65],"tree":[66],"(dot),":[67],"path":[68],"lollipop,":[70],"thus,":[71],"terminology":[73],"dpl":[74,78],"characterization.":[75],"corresponds":[80],"an":[82],"efficient":[83],"search":[84,144,157],"algorithm,":[85,145],"that,":[86,149],"given":[89],"LDPC":[91],"code,":[92],"can":[93,159],"find":[94],"all":[95],"instances":[97],"(a,":[99],"b)":[100],"ETSs":[101],"with":[102,106],"size":[103],"number":[108],"unsatisfied":[110],"check":[111],"nodes":[112],"b,":[113],"within":[114],"any":[115],"range":[116],"interest":[118],"\u2264":[120,127],"<sub":[122,129],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[123,130],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>":[124,131],"b":[126,128],",":[132],"exhaustively.":[133],"Simulation":[134],"results":[135],"presented":[137],"show":[139],"versatility":[141],"demonstrate":[148],"compared":[150],"literature,":[153],"significant":[154],"improvement":[155],"speed":[158],"obtained.":[161]},"counts_by_year":[{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}