{"id":"https://openalex.org/W2118012216","doi":"https://doi.org/10.1109/isit.2010.5513611","title":"Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder","display_name":"Exhaustive search for small fully absorbing sets and the corresponding low error-floor decoder","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2118012216","doi":"https://doi.org/10.1109/isit.2010.5513611","mag":"2118012216"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513611","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513611","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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/A5031997864","display_name":"Gyu Bum Kyung","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gyu Bum Kyung","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","[School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907, USA.]"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"[School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907, USA.]","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006311047","display_name":"Chih-Chun Wang","orcid":"https://orcid.org/0000-0002-1685-820X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chih-Chun Wang","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","[School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907, USA.]"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"[School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN 47907, USA.]","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031997864"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":6.4102,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.96941744,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"48","issue":null,"first_page":"739","last_page":"743"},"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.9976000189781189,"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.991599977016449,"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.7601839303970337},{"id":"https://openalex.org/keywords/trimming","display_name":"Trimming","score":0.6791900992393494},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6316191554069519},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5813689827919006},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4828820526599884},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.45074278116226196},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4430772364139557},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4297091066837311},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4252082407474518},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.42022013664245605},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.418578565120697},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32652074098587036},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.30879509449005127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.292991042137146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15934407711029053}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7601839303970337},{"id":"https://openalex.org/C56951928","wikidata":"https://www.wikidata.org/wiki/Q3539213","display_name":"Trimming","level":2,"score":0.6791900992393494},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6316191554069519},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5813689827919006},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4828820526599884},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.45074278116226196},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4430772364139557},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4297091066837311},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4252082407474518},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.42022013664245605},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.418578565120697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32652074098587036},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.30879509449005127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.292991042137146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15934407711029053},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2010.5513611","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513611","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","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":28,"referenced_works":["https://openalex.org/W1484692004","https://openalex.org/W1508654922","https://openalex.org/W1542197380","https://openalex.org/W1577660440","https://openalex.org/W1588943481","https://openalex.org/W1964402820","https://openalex.org/W2001732758","https://openalex.org/W2054649237","https://openalex.org/W2071304218","https://openalex.org/W2095882513","https://openalex.org/W2106229352","https://openalex.org/W2110841034","https://openalex.org/W2128765501","https://openalex.org/W2133126019","https://openalex.org/W2134576743","https://openalex.org/W2142818093","https://openalex.org/W2151875415","https://openalex.org/W2152474312","https://openalex.org/W2153049761","https://openalex.org/W2155197892","https://openalex.org/W2156660752","https://openalex.org/W2170998175","https://openalex.org/W2962897197","https://openalex.org/W4285719527","https://openalex.org/W4300188436","https://openalex.org/W6628810906","https://openalex.org/W6635197353","https://openalex.org/W6679608262"],"related_works":["https://openalex.org/W2885795561","https://openalex.org/W2011305240","https://openalex.org/W2336199159","https://openalex.org/W2572298685","https://openalex.org/W2030180258","https://openalex.org/W2139164285","https://openalex.org/W4303096056","https://openalex.org/W2789480285","https://openalex.org/W1971267722","https://openalex.org/W2402589461"],"abstract_inverted_index":{"This":[0],"work":[1],"provides":[2],"an":[3,40],"exhaustive":[4,100,123],"search":[5],"algorithm":[6,49,71],"for":[7,44,91,136],"finding":[8,29,75],"small":[9,103,126],"fully":[10],"absorbing":[11],"sets":[12],"(FASs)":[13],"of":[14,28,32,66,74,78,94,102,121,125,138],"arbitrary":[15],"low-density":[16],"parity-check":[17],"(LDPC)":[18],"codes.":[19],"In":[20],"particular,":[21],"given":[22],"any":[23],"LDPC":[24,92],"code,":[25],"the":[26,56,64,67,122,128,133,143],"problem":[27],"all":[30,76],"FASs":[31,77,104],"size":[33,79],"less":[34],"than":[35,85],"t":[36],"is":[37,50,72,105],"formulated":[38],"as":[39],"integer":[41],"programming":[42],"problem,":[43],"which":[45],"a":[46,110],"new":[47,111],"branch-&-bound":[48],"devised.":[51],"New":[52],"node":[53],"selection":[54],"and":[55,141],"tree-trimming":[57],"mechanisms":[58],"are":[59],"designed":[60],"to":[61,108],"further":[62],"enhance":[63],"efficiency":[65],"algorithm.":[68],"The":[69,98],"proposed":[70,129],"capable":[73],"\u2264":[80,96],"11":[81],"with":[82],"no":[83],"larger":[84],"2":[86],"induced":[87],"odd-degree":[88],"check":[89],"nodes":[90],"codes":[93,137],"length":[95],"1000.":[97],"resulting":[99],"list":[101,124],"then":[106],"used":[107],"devise":[109],"post-processing":[112],"decoder.":[113],"Numerical":[114],"results":[115],"show":[116],"that":[117],"by":[118],"taking":[119],"advantage":[120],"FASs,":[127],"decoder":[130],"significantly":[131],"lowers":[132],"error":[134],"floor":[135],"practical":[139],"lengths":[140],"outperforms":[142],"state-of-the-art":[144],"low-error-floor":[145],"decoders.":[146]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}