{"id":"https://openalex.org/W2963924687","doi":"https://doi.org/10.1109/isit.2018.8437465","title":"From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes","display_name":"From Cages to Trapping Sets: A New Technique to Derive Tight Upper Bounds on the Minimum Size of Trapping Sets and Minimum Distance of LDPC Codes","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2963924687","doi":"https://doi.org/10.1109/isit.2018.8437465","mag":"2963924687"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437465","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437465","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.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.28172009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":null,"first_page":"1640","last_page":"1644"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9997000098228455,"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.9984999895095825,"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/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9872000217437744,"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.7156474590301514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6865196824073792},{"id":"https://openalex.org/keywords/trapping","display_name":"Trapping","score":0.6829180717468262},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.6641496419906616},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6047155857086182},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5564414858818054},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5485051274299622},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5071473121643066},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.49124854803085327},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.46310728788375854},{"id":"https://openalex.org/keywords/cage","display_name":"Cage","score":0.4455220103263855},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.42335301637649536},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2823185324668884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2181316614151001},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08501598238945007}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7156474590301514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6865196824073792},{"id":"https://openalex.org/C2777924906","wikidata":"https://www.wikidata.org/wiki/Q34168","display_name":"Trapping","level":2,"score":0.6829180717468262},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.6641496419906616},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6047155857086182},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5564414858818054},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5485051274299622},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5071473121643066},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.49124854803085327},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.46310728788375854},{"id":"https://openalex.org/C160272327","wikidata":"https://www.wikidata.org/wiki/Q841007","display_name":"Cage","level":2,"score":0.4455220103263855},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.42335301637649536},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2823185324668884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2181316614151001},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08501598238945007},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"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/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.2018.8437465","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437465","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":16,"referenced_works":["https://openalex.org/W1982657133","https://openalex.org/W2008209264","https://openalex.org/W2049626643","https://openalex.org/W2065667032","https://openalex.org/W2086877620","https://openalex.org/W2126276563","https://openalex.org/W2157927886","https://openalex.org/W2175070750","https://openalex.org/W2521520100","https://openalex.org/W2558776151","https://openalex.org/W2580476827","https://openalex.org/W2619905542","https://openalex.org/W2766124948","https://openalex.org/W2900233863","https://openalex.org/W6731813352","https://openalex.org/W6746335758"],"related_works":["https://openalex.org/W2005341112","https://openalex.org/W2370232613","https://openalex.org/W2150639697","https://openalex.org/W2602611185","https://openalex.org/W2148630017","https://openalex.org/W2143011401","https://openalex.org/W2163532780","https://openalex.org/W2143965786","https://openalex.org/W2000151856","https://openalex.org/W2132973822"],"abstract_inverted_index":{"Cages,":[0],"defined":[1],"as":[2,169],"regular":[3],"graphs":[4],"with":[5,106],"minimum":[6,156,163],"number":[7],"of":[8,28,97,132,145,158,165,172],"nodes":[9],"for":[10,25,102],"a":[11,55,58,63,107,142,170],"given":[12,108],"girth,":[13],"are":[14,21,34,141],"well-studied":[15],"in":[16,37,66,84,117],"graph":[17,85],"theory.":[18,39],"Trapping":[19],"sets":[20,101],"graphical":[22],"structures":[23],"responsible":[24],"error":[26],"floor":[27],"low-density":[29],"parity-check":[30],"(LDPC)":[31],"codes,":[32],"and":[33,48,75,89,111,126,175],"well":[35],"investigated":[36],"coding":[38],"In":[40,51],"this":[41],"paper,":[42],"we":[43,61,78,148],"make":[44],"connections":[45],"between":[46,73],"cages":[47,74,88],"trapping":[49,64,76,100,135,146],"sets.":[50,136],"particular,":[52],"starting":[53],"from":[54],"cage":[56],"(or":[57],"modified":[59],"cage),":[60],"construct":[62],"set":[65],"multiple":[67],"steps.":[68],"Based":[69],"on":[70,87,94,154],"the":[71,81,95,98,121,129,133,155,162],"connection":[72],"sets,":[77,147],"then":[79],"use":[80],"available":[82],"results":[83],"theory":[86],"derive":[90,150],"tight":[91,151],"upper":[92,115,152],"bounds":[93,116,125,153],"size":[96,131],"smallest":[99,134],"variable-regular":[103,166],"LDPC":[104,167],"codes":[105,168],"variable":[109,173],"degree":[110,174],"girth.":[112,176],"The":[113],"derived":[114],"many":[118],"cases":[119],"meet":[120],"best":[122],"known":[123],"lower":[124],"thus":[127],"provide":[128],"actual":[130],"Considering":[137],"that":[138],"nonzero":[139],"codewords":[140],"special":[143],"case":[144],"also":[149],"weight":[157],"such":[159],"codewords,":[160],"i.e.,":[161],"distance,":[164],"function":[171]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}