{"id":"https://openalex.org/W3018748427","doi":"https://doi.org/10.1109/tcomm.2020.2988676","title":"A Sub-Graph Expansion-Contraction Method for Error Floor Computation","display_name":"A Sub-Graph Expansion-Contraction Method for Error Floor Computation","publication_year":2020,"publication_date":"2020-04-21","ids":{"openalex":"https://openalex.org/W3018748427","doi":"https://doi.org/10.1109/tcomm.2020.2988676","mag":"3018748427"},"language":"en","primary_location":{"id":"doi:10.1109/tcomm.2020.2988676","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2020.2988676","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-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/A5059122162","display_name":"Nithin Raveendran","orcid":"https://orcid.org/0000-0002-1024-8099"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nithin Raveendran","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona, Tucson, USA"],"raw_orcid":"https://orcid.org/0000-0002-1024-8099","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona, Tucson, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022930542","display_name":"David Declercq","orcid":"https://orcid.org/0000-0001-7645-7136"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Declercq","raw_affiliation_strings":["Codelucida. Inc., Tucson, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Codelucida. Inc., Tucson, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040676835","display_name":"Bane Vasi\u0107","orcid":"https://orcid.org/0000-0003-2365-4106"},"institutions":[{"id":"https://openalex.org/I138006243","display_name":"University of Arizona","ror":"https://ror.org/03m2x1q45","country_code":"US","type":"education","lineage":["https://openalex.org/I138006243"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bane Vasic","raw_affiliation_strings":["Codelucida. Inc., Tucson, USA","Department of Electrical and Computer Engineering, University of Arizona, Tucson, USA"],"raw_orcid":"https://orcid.org/0000-0003-2365-4106","affiliations":[{"raw_affiliation_string":"Codelucida. Inc., Tucson, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona, Tucson, USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5932,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.90105438,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"68","issue":"7","first_page":"3984","last_page":"3995"},"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.9929999709129333,"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.9904000163078308,"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.8270570039749146},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6765737533569336},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6479289531707764},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6035645008087158},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5984621047973633},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5840281248092651},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.533474862575531},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48952803015708923},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.45809727907180786},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.4352450370788574},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.42562782764434814},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36394423246383667},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3490058183670044},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.3113800287246704},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.21575099229812622},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.08147034049034119}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8270570039749146},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6765737533569336},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6479289531707764},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6035645008087158},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5984621047973633},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5840281248092651},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.533474862575531},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48952803015708923},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.45809727907180786},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4352450370788574},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.42562782764434814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36394423246383667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3490058183670044},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.3113800287246704},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.21575099229812622},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.08147034049034119}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tcomm.2020.2988676","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcomm.2020.2988676","pdf_url":null,"source":{"id":"https://openalex.org/S196647941","display_name":"IEEE Transactions on Communications","issn_l":"0090-6778","issn":["0090-6778","1558-0857"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Communications","raw_type":"journal-article"},{"id":"pmh:oai:repository.arizona.edu:10150/641957","is_oa":false,"landing_page_url":"http://hdl.handle.net/10150/641957","pdf_url":null,"source":{"id":"https://openalex.org/S4306400271","display_name":"UA Campus Repository (The University of Arizona)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138006243","host_organization_name":"University of Arizona","host_organization_lineage":["https://openalex.org/I138006243"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"3995","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5199999809265137,"display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G200424523","display_name":null,"funder_award_id":"CCF-1855879","funder_id":"https://openalex.org/F4320335353","funder_display_name":"National Science Foundation of Sri Lanka"},{"id":"https://openalex.org/G559024463","display_name":null,"funder_award_id":"1534760","funder_id":"https://openalex.org/F4320332170","funder_display_name":"Directorate for Engineering"},{"id":"https://openalex.org/G7763860205","display_name":null,"funder_award_id":"SaTC- 1813401","funder_id":"https://openalex.org/F4320335353","funder_display_name":"National Science Foundation of Sri Lanka"}],"funders":[{"id":"https://openalex.org/F4320332170","display_name":"Directorate for Engineering","ror":"https://ror.org/00b6sbb32"},{"id":"https://openalex.org/F4320335353","display_name":"National Science Foundation of Sri Lanka","ror":"https://ror.org/010xaa060"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W110147139","https://openalex.org/W1484692004","https://openalex.org/W1979802120","https://openalex.org/W1993508000","https://openalex.org/W1997785613","https://openalex.org/W2032128222","https://openalex.org/W2114074598","https://openalex.org/W2125250903","https://openalex.org/W2128765501","https://openalex.org/W2150570316","https://openalex.org/W2152474312","https://openalex.org/W2154663979","https://openalex.org/W2155963493","https://openalex.org/W2156541068","https://openalex.org/W2158843246","https://openalex.org/W2161514549","https://openalex.org/W2166478505","https://openalex.org/W2169732368","https://openalex.org/W2293231900","https://openalex.org/W2511387816","https://openalex.org/W2553702736","https://openalex.org/W2566676917","https://openalex.org/W2949560198","https://openalex.org/W4285719527","https://openalex.org/W4300188436","https://openalex.org/W6628810906"],"related_works":["https://openalex.org/W2030180258","https://openalex.org/W4303096056","https://openalex.org/W1972501090","https://openalex.org/W2139164285","https://openalex.org/W2391969905","https://openalex.org/W2005160024","https://openalex.org/W2124455219","https://openalex.org/W2122913048","https://openalex.org/W2121986337","https://openalex.org/W2063383946"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,39,50,107,114,190],"computationally":[6],"efficient":[7],"method":[8,47,188],"for":[9,99],"estimating":[10],"error":[11,83,97,121,138,146,160],"floors":[12],"of":[13,28,38,52,71,93,95,109,118,135,145,158,163],"low-density":[14],"parity-check":[15],"(LDPC)":[16],"codes":[17],"over":[18,196],"the":[19,34,42,46,72,96,119,136,143,159,186],"binary":[20],"symmetric":[21],"channel":[22],"(BSC)":[23],"without":[24],"any":[25],"prior":[26],"knowledge":[27,117],"its":[29,63],"trapping":[30],"sets":[31],"(TSs).":[32],"Given":[33],"Tanner":[35],"graph":[36],"G":[37],"code,":[40],"and":[41,57,85,123,151,176],"decoding":[43],"algorithm":[44],"V,":[45],"starts":[48],"from":[49],"list":[51],"short":[53],"cycles":[54],"in":[55,67,126,183,193],"G,":[56],"expands":[58],"each":[59,104,127],"cycle":[60],"by":[61,80,87],"including":[62],"sufficiently":[64],"large":[65],"neighborhood":[66],"G.":[68],"Variable":[69],"nodes":[70,111],"expanded":[73],"sub-graphs":[74],"EXP":[75,105],"are":[76],"then":[77],"corrupted":[78],"exhaustively":[79],"all":[81],"possible":[82],"patterns,":[84],"decoded":[86],"V":[88,101,164],"operating":[89],"on":[90,103,149],"EXP.":[91],"Union":[92],"support":[94],"patterns":[98,122],"which":[100],"fails":[102],"defines":[106],"subset":[108],"variable":[110],"that":[112,182],"is":[113,129],"TS.":[115],"The":[116],"minimal":[120],"their":[124],"strengths":[125],"TSs":[128],"used":[130],"to":[131],"compute":[132],"an":[133,155],"estimation":[134,141,157],"frame":[137],"rate.":[139],"This":[140],"represents":[142],"contribution":[144],"events":[147],"localized":[148],"TSs,":[150],"therefore":[152],"serves":[153],"as":[154],"accurate":[156],"floor":[161],"performance":[162],"at":[165],"low":[166],"BSC":[167],"cross-over":[168],"probabilities.":[169],"We":[170],"also":[171],"discuss":[172],"trade-offs":[173],"between":[174],"accuracy":[175],"computational":[177,194],"complexity.":[178],"Our":[179],"analysis":[180],"shows":[181],"some":[184],"cases":[185],"proposed":[187],"provides":[189],"million-fold":[191],"improvement":[192],"complexity":[195],"standard":[197],"Monte-Carlo":[198],"simulation.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}