{"id":"https://openalex.org/W2514571107","doi":"https://doi.org/10.1109/isit.2016.7541754","title":"Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes","display_name":"Minimal characterization and provably efficient exhaustive search algorithm for elementary trapping sets of variable-regular LDPC codes","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2514571107","doi":"https://doi.org/10.1109/isit.2016.7541754","mag":"2514571107"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10109646,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2524","last_page":"2528"},"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.9950000047683716,"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.9941999912261963,"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/characterization","display_name":"Characterization (materials science)","score":0.7323802709579468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5952188968658447},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5198826789855957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5066636204719543},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4438478350639343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3725159168243408},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3365631401538849},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2916983366012573}],"concepts":[{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.7323802709579468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5952188968658447},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5198826789855957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5066636204719543},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4438478350639343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3725159168243408},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3365631401538849},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2916983366012573},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541754","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541754","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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":15,"referenced_works":["https://openalex.org/W152471750","https://openalex.org/W1964402820","https://openalex.org/W1983904405","https://openalex.org/W2008209264","https://openalex.org/W2009260494","https://openalex.org/W2021979706","https://openalex.org/W2032128222","https://openalex.org/W2054540803","https://openalex.org/W2157927886","https://openalex.org/W2170998175","https://openalex.org/W2273578344","https://openalex.org/W2521520100","https://openalex.org/W4285719527","https://openalex.org/W6606175091","https://openalex.org/W6694067910"],"related_works":["https://openalex.org/W4391375266","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/W3107994849","https://openalex.org/W4213381250"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,30,42,47,64,101,152,164,201,203,219,243],"new":[6,70,81],"characterization":[7,31,71,177,187,240],"and":[8,27,223],"an":[9,39,98],"efficient":[10,245,250],"exhaustive":[11],"search":[12,104,107,246],"algorithm":[13,108],"for":[14,184,215],"elementary":[15],"trapping":[16],"sets":[17],"(ETS)":[18],"of":[19,32,46,79,100,113,122,128,161,168,218,232],"variable-regular":[20],"low-density":[21],"parity-check":[22],"(LDPC)":[23],"codes.":[24],"Recently,":[25],"Karimi":[26],"Banihashemi":[28],"proposed":[29,186,239],"ETSs,":[33],"which":[34,60],"was":[35],"based":[36,62],"on":[37,63],"viewing":[38],"ETS":[40,95,145,193],"as":[41],"layered":[43],"superset":[44],"(LSS)":[45],"short":[48],"cycle":[49],"in":[50],"the":[51,57,69,80,111,120,123,126,140,159,162,166,176,185,192,196,229,233,252],"code's":[52],"Tanner":[53],"graph.":[54],"Compared":[55],"to":[56,188,242],"LSS-based":[58,87,106,253],"characterization,":[59],"is":[61,97,178,236],"single":[65],"LSS":[66,99],"expansion":[67,75,142],"technique,":[68],"involves":[72],"two":[73,84],"additional":[74],"techniques.":[76],"The":[77,238],"introduction":[78],"techniques":[82],"mitigates":[83],"problems":[85],"that":[86,138,183],"characterization/search":[88],"suffers":[89],"from:":[90],"(1)":[91],"exhaustiveness:":[92],"not":[93],"every":[94],"structure":[96,146,163],"cycle,":[102,154],"(2)":[103],"efficiency:":[105],"often":[109],"requires":[110],"enumeration":[112],"cycles":[114,130,235],"with":[115,133,200],"length":[116,231],"much":[117],"larger":[118],"than":[119,251],"girth":[121],"graph,":[124],"where":[125],"multiplicity":[127],"such":[129],"increases":[131],"rapidly":[132],"their":[134],"length.":[135],"We":[136,180],"prove":[137],"using":[139],"three":[141],"techniques,":[143],"any":[144,216],"can":[147],"be":[148],"obtained":[149],"starting":[150],"from":[151],"simple":[153],"no":[155],"matter":[156],"how":[157],"large":[158],"size":[160],"or":[165],"number":[167],"its":[169],"unsatisfied":[170],"check":[171],"nodes":[172],"b":[173,208,210,224],"are,":[174],"i.e.,":[175],"exhaustive.":[179],"also":[181],"demonstrate":[182],"exhaustively":[189],"cover":[190],"all":[191],"structures":[194],"within":[195],"(a,":[197],"b)":[198],"classes":[199],"\u2264":[202,209],"<sub":[204,211,220,225],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[205,212,221,226],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>":[206,213,222,227],",":[207,214,228],"value":[217],"maximum":[230],"required":[234],"minimal.":[237],"corresponds":[241],"provably":[244],"algorithm,":[247],"significantly":[248],"more":[249],"search.":[254]},"counts_by_year":[],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}