{"id":"https://openalex.org/W2028750656","doi":"https://doi.org/10.1109/isit.2007.4557664","title":"An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices","display_name":"An Algorithm to Find All Small-Size Stopping Sets of Low-Density Parity-Check Matrices","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2028750656","doi":"https://doi.org/10.1109/isit.2007.4557664","mag":"2028750656"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557664","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 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/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":["Department of Informatics, University of Bergen, Bergen, Norway","Dept. of Inf., Univ. of Bergen, Bergen#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Dept. of Inf., Univ. of Bergen, Bergen#TAB#","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":"Oyvind Ytrehus","raw_affiliation_strings":["Department of Informatics, University of Bergen, Bergen, Norway","Dept. of Inf., Univ. of Bergen, Bergen#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]},{"raw_affiliation_string":"Dept. of Inf., Univ. of Bergen, Bergen#TAB#","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":3.3685,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.92559901,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"2","issue":null,"first_page":"2936","last_page":"2940"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9972000122070312,"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.6960557699203491},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.627257764339447},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.47069478034973145},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4655595123767853},{"id":"https://openalex.org/keywords/ramanujans-sum","display_name":"Ramanujan's sum","score":0.4362209439277649},{"id":"https://openalex.org/keywords/multiplicity","display_name":"Multiplicity (mathematics)","score":0.42236435413360596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4146067202091217},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.41151130199432373},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3874085247516632},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.31057024002075195},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2318330705165863}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6960557699203491},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.627257764339447},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.47069478034973145},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4655595123767853},{"id":"https://openalex.org/C131220774","wikidata":"https://www.wikidata.org/wiki/Q1441456","display_name":"Ramanujan's sum","level":2,"score":0.4362209439277649},{"id":"https://openalex.org/C156004811","wikidata":"https://www.wikidata.org/wiki/Q2228257","display_name":"Multiplicity (mathematics)","level":2,"score":0.42236435413360596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4146067202091217},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41151130199432373},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3874085247516632},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.31057024002075195},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2318330705165863},{"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/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.2007.4557664","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557664","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 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":42,"referenced_works":["https://openalex.org/W15432375","https://openalex.org/W152471750","https://openalex.org/W1484692004","https://openalex.org/W1498552305","https://openalex.org/W1572884776","https://openalex.org/W1588943481","https://openalex.org/W1617021041","https://openalex.org/W1633530582","https://openalex.org/W1813544306","https://openalex.org/W1964402820","https://openalex.org/W1976450468","https://openalex.org/W2001732758","https://openalex.org/W2035929826","https://openalex.org/W2047776564","https://openalex.org/W2054649237","https://openalex.org/W2095882513","https://openalex.org/W2104345270","https://openalex.org/W2111319461","https://openalex.org/W2114515865","https://openalex.org/W2114869758","https://openalex.org/W2115104320","https://openalex.org/W2119319086","https://openalex.org/W2128765501","https://openalex.org/W2133126019","https://openalex.org/W2135764410","https://openalex.org/W2150824852","https://openalex.org/W2169732368","https://openalex.org/W2171294544","https://openalex.org/W2962897197","https://openalex.org/W4285719527","https://openalex.org/W6600591868","https://openalex.org/W6606175091","https://openalex.org/W6628810906","https://openalex.org/W6629673210","https://openalex.org/W6634387629","https://openalex.org/W6635197353","https://openalex.org/W6636640841","https://openalex.org/W6636849812","https://openalex.org/W6638490971","https://openalex.org/W6651001258","https://openalex.org/W6679608262","https://openalex.org/W6682410915"],"related_works":["https://openalex.org/W4232537912","https://openalex.org/W3168862451","https://openalex.org/W2984694848","https://openalex.org/W4241348014","https://openalex.org/W4287271148","https://openalex.org/W4290033678","https://openalex.org/W2169710030","https://openalex.org/W2321846176","https://openalex.org/W2126543779","https://openalex.org/W2147429396"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3,69,102],"introduce":[4],"an":[5,42],"efficient":[6],"algorithm":[7,32,60,73],"to":[8,40,74],"find":[9,41],"all":[10,46,84],"stopping":[11,49,85,108],"sets":[12,50,86],"of":[13,19,45,57,87,111],"size":[14,88,110],"less":[15],"than":[16],"some":[17],"threshold":[18],"a":[20,52,97],"fixed":[21],"low-density":[22],"parity-check":[23],"(LDPC)":[24],"matrix.":[25],"The":[26,55],"solution":[27],"is":[28,61,116,124],"inspired":[29],"by":[30,34,63],"the":[31,58,72,75,106,112,121],"proposed":[33,59],"Rosnes":[35],"and":[36,82,119],"Ytrehus":[37],"in":[38,51,92],"2005":[39],"exhaustive":[43],"list":[44],"small-size":[47],"turbo":[48,53],"code.":[54],"efficiency":[56],"demonstrated":[62],"several":[64],"numerical":[65],"examples.":[66],"For":[67],"instance,":[68],"have":[70,103],"applied":[71],"well-known":[76],"(3,":[77],"5)-regular":[78],"(155,64)":[79],"Tanner":[80],"code":[81,115],"found":[83],"at":[89],"most":[90],"18":[91],"about":[93],"one":[94],"minute":[95],"on":[96],"standard":[98],"desktop":[99],"computer.":[100],"Also,":[101],"verified":[104],"that":[105,120],"minimum":[107],"set":[109],"(4896,2474)":[113],"Ramanujan-Margulis":[114],"indeed":[117],"24,":[118],"corresponding":[122],"multiplicity":[123],"exactly":[125],"204.":[126]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}