{"id":"https://openalex.org/W2156660752","doi":"https://doi.org/10.1109/tit.2009.2025573","title":"An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices","display_name":"An Efficient Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices","publication_year":2009,"publication_date":"2009-08-24","ids":{"openalex":"https://openalex.org/W2156660752","doi":"https://doi.org/10.1109/tit.2009.2025573","mag":"2156660752"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2009.2025573","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2025573","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Information Theory","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/A5090738616","display_name":"Eirik Rosnes","orcid":"https://orcid.org/0000-0001-8236-6601"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Eirik Rosnes","raw_affiliation_strings":["Selmer Center, Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Selmer Center, Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081966529","display_name":"\u00d8yvind Ytrehus","orcid":"https://orcid.org/0000-0001-5223-7577"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"\u00d8yvind Ytrehus","raw_affiliation_strings":["Selmer Center, Department of Informatics, University of Bergen, Bergen, Norway"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Selmer Center, Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.9835,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.97677715,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"55","issue":"9","first_page":"4167","last_page":"4178"},"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.9991000294685364,"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.9988999962806702,"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/tanner-graph","display_name":"Tanner graph","score":0.7902171611785889},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7889723181724548},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5769179463386536},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5754018425941467},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5234774351119995},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.5004005432128906},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4869149923324585},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3610919117927551}],"concepts":[{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.7902171611785889},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7889723181724548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5769179463386536},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5754018425941467},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5234774351119995},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.5004005432128906},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4869149923324585},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3610919117927551},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2009.2025573","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2009.2025573","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["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 Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":67,"referenced_works":["https://openalex.org/W15432375","https://openalex.org/W152471750","https://openalex.org/W1484692004","https://openalex.org/W1498552305","https://openalex.org/W1555985201","https://openalex.org/W1572884776","https://openalex.org/W1573665190","https://openalex.org/W1588943481","https://openalex.org/W1813544306","https://openalex.org/W1964402820","https://openalex.org/W1976450468","https://openalex.org/W1998242373","https://openalex.org/W2001732758","https://openalex.org/W2035929826","https://openalex.org/W2046091144","https://openalex.org/W2047776564","https://openalex.org/W2054649237","https://openalex.org/W2091364465","https://openalex.org/W2095882513","https://openalex.org/W2100305297","https://openalex.org/W2102630100","https://openalex.org/W2104345270","https://openalex.org/W2104459449","https://openalex.org/W2111319461","https://openalex.org/W2114515865","https://openalex.org/W2114869758","https://openalex.org/W2115104320","https://openalex.org/W2115193201","https://openalex.org/W2115929510","https://openalex.org/W2117432646","https://openalex.org/W2119319086","https://openalex.org/W2121976196","https://openalex.org/W2126324363","https://openalex.org/W2127108424","https://openalex.org/W2128765501","https://openalex.org/W2130332106","https://openalex.org/W2130458083","https://openalex.org/W2133068391","https://openalex.org/W2133126019","https://openalex.org/W2135764410","https://openalex.org/W2140124864","https://openalex.org/W2140227657","https://openalex.org/W2142818093","https://openalex.org/W2144727550","https://openalex.org/W2150824852","https://openalex.org/W2164585870","https://openalex.org/W2169426742","https://openalex.org/W2169665116","https://openalex.org/W2169732368","https://openalex.org/W2170758137","https://openalex.org/W2171294544","https://openalex.org/W2187326887","https://openalex.org/W2913688336","https://openalex.org/W2962897197","https://openalex.org/W4240374930","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W6600591868","https://openalex.org/W6606175091","https://openalex.org/W6628810906","https://openalex.org/W6629673210","https://openalex.org/W6633192324","https://openalex.org/W6634387629","https://openalex.org/W6635197353","https://openalex.org/W6638490971","https://openalex.org/W6650123458","https://openalex.org/W6679608262"],"related_works":["https://openalex.org/W2147429396","https://openalex.org/W2090897912","https://openalex.org/W2125154953","https://openalex.org/W1526609637","https://openalex.org/W2150639697","https://openalex.org/W3087284767","https://openalex.org/W2122913048","https://openalex.org/W2996745071","https://openalex.org/W3080746295","https://openalex.org/W2083917443"],"abstract_inverted_index":{"In":[0],"this":[1,227,258],"work,":[2],"we":[3,69,103,130,160,217],"introduce":[4],"an":[5,42,158],"efficient":[6],"algorithm":[7,32,60,73,134,164],"to":[8,40,74,135,165,174,176,183],"find":[9,41,166],"all":[10,46,85,185],"stopping":[11,49,86,109,145,186,231],"sets,":[12],"of":[13,19,45,57,88,112,170,193,204,213,233,242],"size":[14,89,111,147,194,234],"less":[15,195,235],"than":[16,196,236],"some":[17],"threshold,":[18],"a":[20,52,98,162,167,219],"fixed":[21],"low-density":[22],"parity-check":[23,179,224,260],"(LDPC)":[24],"matrix.":[25],"The":[26,55],"solution":[27],"is":[28,61,118,126,262],"inspired":[29],"by":[30,34,63],"the":[31,58,72,75,107,113,123,133,136,143,149,177,189,197,205,211,214,237,246],"proposed":[33,59],"Rosnes":[35],"and":[36,83,121,141,148,216],"Ytrehus":[37],"in":[38,51,93,181,188],"2005":[39],"exhaustive":[43],"list":[44],"small-size":[47],"turbo":[48,53],"sets":[50,87,187,232],"code.":[54],"efficiency":[56],"demonstrated":[62],"several":[64],"numerical":[65],"examples.":[66],"For":[67],"instance,":[68],"have":[70,104,131],"applied":[71,132],"well-known":[76],"(3,":[77],"5)-regular":[78],"(155,":[79,206],"64)":[80,207],"Tanner":[81,191,208],"code":[82,117,209,228],"found":[84],"at":[90],"most":[91],"18":[92],"about":[94],"1":[95],"min":[96],"on":[97,245],"standard":[99],"desktop":[100],"computer.":[101],"Also,":[102],"verified":[105],"that":[106,122],"minimum":[108,144,198,238],"set":[110,146],"(4896,":[114],"2474)":[115],"Ramanujan-Margulis":[116],"indeed":[119],"24,":[120],"corresponding":[124,150,190],"multiplicity":[125,151],"exactly":[127,152],"204.":[128],"Furthermore,":[129],"IEEE":[137],"802.16e":[138],"LDPC":[139],"codes":[140],"determined":[142],"for":[153,226,253,264],"these":[154],"codes.":[155],"Finally,":[156],"as":[157],"application,":[159],"present":[161,218],"greedy":[163],"small":[168],"number":[169],"redundant":[171,223,259],"parity":[172],"checks":[173],"add":[175],"original":[178],"matrix":[180,225,261],"order":[182],"remove":[184],"graph":[192],"distance.":[199,239],"An":[200],"extensive":[201],"case":[202],"study":[203],"illustrates":[210],"usefulness":[212],"algorithm,":[215],"110":[220],"times":[221],"155":[222],"with":[229],"no":[230],"Simulation":[240],"results":[241],"iterative":[243],"decoding":[244],"binary":[247],"erasure":[248,255],"channel":[249],"show":[250],"performance":[251],"improvements":[252],"low-to-medium":[254],"probabilities":[256],"when":[257],"used":[263],"decoding.":[265]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":12}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}