{"id":"https://openalex.org/W2151875415","doi":"https://doi.org/10.1109/tit.2010.2040941","title":"On the Hardness of Approximating Stopping and Trapping Sets","display_name":"On the Hardness of Approximating Stopping and Trapping Sets","publication_year":2010,"publication_date":"2010-03-24","ids":{"openalex":"https://openalex.org/W2151875415","doi":"https://doi.org/10.1109/tit.2010.2040941","mag":"2151875415"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2010.2040941","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2040941","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/A5101979548","display_name":"Andrew McGregor","orcid":"https://orcid.org/0000-0002-2124-160X"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew McGregor","raw_affiliation_strings":["Department of Computer Science, University of Massachusetts, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Massachusetts, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084947882","display_name":"Olgica Milenkovi\u0107","orcid":"https://orcid.org/0000-0002-1871-4912"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Olgica Milenkovic","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101979548"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":7.8235,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.97640416,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"56","issue":"4","first_page":"1640","last_page":"1650"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9980000257492065,"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.9962999820709229,"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.8157069087028503},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6346762180328369},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.6167778372764587},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5385599732398987},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5180823802947998},{"id":"https://openalex.org/keywords/trapping","display_name":"Trapping","score":0.5126725435256958},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.48760905861854553},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.47422242164611816},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4703526496887207},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4162635803222656},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4161342978477478},{"id":"https://openalex.org/keywords/probability-of-error","display_name":"Probability of error","score":0.4121548533439636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4056152105331421},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3563709855079651},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.33331799507141113},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.320967435836792},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.056639015674591064}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8157069087028503},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6346762180328369},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.6167778372764587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5385599732398987},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5180823802947998},{"id":"https://openalex.org/C2777924906","wikidata":"https://www.wikidata.org/wiki/Q34168","display_name":"Trapping","level":2,"score":0.5126725435256958},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.48760905861854553},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47422242164611816},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4703526496887207},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4162635803222656},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4161342978477478},{"id":"https://openalex.org/C92224547","wikidata":"https://www.wikidata.org/wiki/Q1673216","display_name":"Probability of error","level":2,"score":0.4121548533439636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4056152105331421},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3563709855079651},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.33331799507141113},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.320967435836792},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.056639015674591064},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2010.2040941","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2010.2040941","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":[{"score":0.550000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G8189735192","display_name":"CAREER:  Coding Theoretic Problems in Genetic Data Acquisition, Modeling and Analysis","funder_award_id":"0644427","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W5091314","https://openalex.org/W7241855","https://openalex.org/W1484692004","https://openalex.org/W1508654922","https://openalex.org/W1517722749","https://openalex.org/W1555985201","https://openalex.org/W1577660440","https://openalex.org/W1617021041","https://openalex.org/W1621435553","https://openalex.org/W1772907943","https://openalex.org/W1963871092","https://openalex.org/W1968525006","https://openalex.org/W1975218943","https://openalex.org/W2001732758","https://openalex.org/W2001777589","https://openalex.org/W2003159902","https://openalex.org/W2011039300","https://openalex.org/W2022712087","https://openalex.org/W2028750656","https://openalex.org/W2030087828","https://openalex.org/W2035929826","https://openalex.org/W2073689249","https://openalex.org/W2095761422","https://openalex.org/W2095882513","https://openalex.org/W2098844016","https://openalex.org/W2103236224","https://openalex.org/W2111319461","https://openalex.org/W2114515865","https://openalex.org/W2114616381","https://openalex.org/W2120926795","https://openalex.org/W2122074070","https://openalex.org/W2126259959","https://openalex.org/W2127875464","https://openalex.org/W2128765501","https://openalex.org/W2161514549","https://openalex.org/W2169665116","https://openalex.org/W2169732368","https://openalex.org/W2611804663","https://openalex.org/W2804485454","https://openalex.org/W2913688336","https://openalex.org/W2952536339","https://openalex.org/W3101070717","https://openalex.org/W3144422206","https://openalex.org/W4230573295","https://openalex.org/W4285719527","https://openalex.org/W4292230561","https://openalex.org/W4300188436","https://openalex.org/W6628810906","https://openalex.org/W6633237068","https://openalex.org/W6636640841","https://openalex.org/W6638033105"],"related_works":["https://openalex.org/W1972501090","https://openalex.org/W2391969905","https://openalex.org/W2122913048","https://openalex.org/W60780125","https://openalex.org/W2121986337","https://openalex.org/W2063383946","https://openalex.org/W2106229352","https://openalex.org/W2545585602","https://openalex.org/W2354050801","https://openalex.org/W2035769530"],"abstract_inverted_index":{"We":[0],"prove":[1],"that":[2,36],"approximating":[3],"the":[4,21,41,44],"size":[5],"of":[6,14,23,32,43,46],"stopping":[7,54],"and":[8,18,48,55],"trapping":[9,56],"sets":[10],"in":[11],"Tanner":[12],"graphs":[13],"linear":[15],"block":[16],"codes,":[17,27,51],"more":[19],"restrictively,":[20],"class":[22],"low-density":[24],"parity-check":[25],"(LDPC)":[26],"is":[28],"NP-hard.":[29],"The":[30],"ramifications":[31],"our":[33],"findings":[34],"are":[35],"methods":[37],"used":[38],"for":[39,65],"estimating":[40],"height":[42],"error-floor":[45],"moderate-":[47],"long-length":[49],"LDPC":[50],"based":[52],"on":[53],"set":[57],"enumeration,":[58],"cannot":[59],"provide":[60],"accurate":[61],"worst-case":[62],"performance":[63],"predictions":[64],"most":[66],"codes.":[67]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}