{"id":"https://openalex.org/W2886750952","doi":"https://doi.org/10.1109/isit.2018.8437837","title":"Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles","display_name":"Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random LDPC Code Ensembles","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2886750952","doi":"https://doi.org/10.1109/isit.2018.8437837","mag":"2886750952"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437837","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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/A5064297618","display_name":"Ali Dehghan","orcid":"https://orcid.org/0000-0002-1543-1124"},"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":"Ali Dehghan","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/A5064297618"],"corresponding_institution_ids":["https://openalex.org/I67031392"],"apc_list":null,"apc_paid":null,"fwci":0.5536,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.70136044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1650","last_page":"1654"},"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.9973000288009644,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7959831953048706},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6845735907554626},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.6239563822746277},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6236575841903687},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5967881679534912},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5268223285675049},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5207238793373108},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4760275185108185},{"id":"https://openalex.org/keywords/trapping","display_name":"Trapping","score":0.43491053581237793},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.43141669034957886},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4036068022251129},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2895756959915161},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21034273505210876},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.18846088647842407},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.10018730163574219},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06657284498214722}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7959831953048706},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6845735907554626},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.6239563822746277},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6236575841903687},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5967881679534912},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5268223285675049},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5207238793373108},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4760275185108185},{"id":"https://openalex.org/C2777924906","wikidata":"https://www.wikidata.org/wiki/Q34168","display_name":"Trapping","level":2,"score":0.43491053581237793},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.43141669034957886},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4036068022251129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2895756959915161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21034273505210876},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.18846088647842407},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.10018730163574219},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06657284498214722},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437837","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 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":14,"referenced_works":["https://openalex.org/W390146837","https://openalex.org/W2106675807","https://openalex.org/W2151875415","https://openalex.org/W2153344955","https://openalex.org/W2163496715","https://openalex.org/W2166478505","https://openalex.org/W2167943285","https://openalex.org/W2170998175","https://openalex.org/W2521520100","https://openalex.org/W2558776151","https://openalex.org/W2566676917","https://openalex.org/W2579410364","https://openalex.org/W2617294460","https://openalex.org/W2905110430"],"related_works":["https://openalex.org/W2808439818","https://openalex.org/W1968533815","https://openalex.org/W2150639697","https://openalex.org/W2126464345","https://openalex.org/W2090897912","https://openalex.org/W2351144917","https://openalex.org/W2142415334","https://openalex.org/W2125154953","https://openalex.org/W2996745071","https://openalex.org/W2099903672"],"abstract_inverted_index":{"The":[0],"performance":[1],"of":[2,18,39,42,75,78,91,134,138,149,158],"low-density":[3],"parity-check":[4],"(LDPC)":[5],"codes":[6],"in":[7,63],"the":[8,19,35,76,79,82,88,106,121,124,135,139,142,146,150,159,166],"error":[9],"floor":[10],"region":[11],"is":[12],"closely":[13],"related":[14],"to":[15,25,86,96,98,103,172],"some":[16],"substructures":[17],"code's":[20,83,167],"Tanner":[21],"graph,":[22],"collectively":[23],"referred":[24],"as":[26,46,81],"trapping":[27,43],"sets":[28,44,54,61],"(TSs).":[29],"In":[30],"this":[31],"paper,":[32],"we":[33,130],"study":[34],"asymptotic":[36],"average":[37,89,147],"number":[38,90,137,148],"different":[40],"types":[41],"such":[45],"elementary":[47,56],"TSs":[48],"(ETS),":[49],"leafless":[50],"ETSs":[51],"(LETS),":[52],"absorbing":[53],"(ABS),":[55],"ABSs":[57],"(EABS),":[58],"and":[59,66,162],"stopping":[60],"(SS),":[62],"random":[64],"variable-regular":[65],"irregular":[67],"LDPC":[68],"code":[69],"ensembles.":[70],"We":[71],"demonstrate":[72],"that,":[73],"regardless":[74],"type":[77],"TS,":[80],"length":[84,161],"tends":[85,95],"infinity,":[87,97],"a":[92,99,127],"given":[93],"structure":[94,107,125,140],"positive":[100],"constant,":[101],"or":[102,114],"zero,":[104],"if":[105],"contains":[108,126],"no":[109],"cycle,":[110,113,118,129],"only":[111,163],"one":[112,117],"more":[115],"than":[116],"respectively.":[119],"For":[120],"case":[122],"where":[123],"single":[128],"obtain":[131],"an":[132],"estimate":[133],"expected":[136],"through":[141],"available":[143],"approximations":[144],"for":[145,176],"constituent":[151],"cycle.":[152],"These":[153],"estimates,":[154],"which":[155],"are":[156,170],"independent":[157],"block":[160],"depend":[164],"on":[165],"degree":[168],"distributions,":[169],"shown":[171],"be":[173],"accurate":[174],"even":[175],"finite-length":[177],"codes.":[178]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}