{"id":"https://openalex.org/W1977242601","doi":"https://doi.org/10.1109/glocom.2011.6133832","title":"Efficient Algorithms to Find All Small Error-Prone Substructures in LDPC Codes","display_name":"Efficient Algorithms to Find All Small Error-Prone Substructures in LDPC Codes","publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W1977242601","doi":"https://doi.org/10.1109/glocom.2011.6133832","mag":"1977242601"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2011.6133832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6133832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","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/A5100718556","display_name":"Xiaojie Zhang","orcid":"https://orcid.org/0009-0005-6576-1876"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xiaojie Zhang","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA","[Dept of Electr. & Comput. Eng., Univ. of California San Diego, La Jolla, CA, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"[Dept of Electr. & Comput. Eng., Univ. of California San Diego, La Jolla, CA, USA]","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060049531","display_name":"Paul H. Siegel","orcid":"https://orcid.org/0000-0001-5850-0874"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. H. Siegel","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA","[Dept of Electr. & Comput. Eng., Univ. of California San Diego, La Jolla, CA, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"[Dept of Electr. & Comput. Eng., Univ. of California San Diego, La Jolla, CA, USA]","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100718556"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":4.7505,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.94789394,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9976999759674072,"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/T11130","display_name":"Coding theory and cryptography","score":0.9879000186920166,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8270010948181152},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.7421280145645142},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.705141007900238},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5473229885101318},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.48085886240005493},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.42547959089279175},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4013156592845917},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3585432171821594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.330861896276474},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.09453931450843811}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8270010948181152},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7421280145645142},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.705141007900238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5473229885101318},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.48085886240005493},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.42547959089279175},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4013156592845917},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3585432171821594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.330861896276474},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.09453931450843811},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/glocom.2011.6133832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2011.6133832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Global Telecommunications Conference - GLOBECOM 2011","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.365.8351","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.8351","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cmrr.ucsd.edu/people/siegel/documents/efficientalgorithms.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W152471750","https://openalex.org/W1484692004","https://openalex.org/W1542197380","https://openalex.org/W1588943481","https://openalex.org/W2001732758","https://openalex.org/W2054540803","https://openalex.org/W2095882513","https://openalex.org/W2118012216","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2142415334","https://openalex.org/W2142818093","https://openalex.org/W2151875415","https://openalex.org/W2152474312","https://openalex.org/W2156660752","https://openalex.org/W2170998175","https://openalex.org/W2962897197","https://openalex.org/W4285719527","https://openalex.org/W6606175091","https://openalex.org/W6628810906","https://openalex.org/W6635197353"],"related_works":["https://openalex.org/W3204184292","https://openalex.org/W3176564347","https://openalex.org/W1985458517","https://openalex.org/W2355833770","https://openalex.org/W3031039437","https://openalex.org/W1968289971","https://openalex.org/W4300588357","https://openalex.org/W2980068837","https://openalex.org/W2124455219","https://openalex.org/W2098872742"],"abstract_inverted_index":{"Exhaustively":[0],"enumerating":[1],"all":[2,50],"small":[3,32],"error-prone":[4,33,51],"sub":[5],"structures":[6],"in":[7,108],"arbitrary,":[8],"finite-length":[9],"low-density":[10],"parity-check":[11,42],"(LDPC)":[12],"codes":[13],"has":[14],"been":[15],"proven":[16],"to":[17,29,48,74,90],"be":[18,131],"NP-complete.":[19],"In":[20],"this":[21],"paper,":[22],"we":[23],"present":[24],"two":[25],"exhaustive":[26,117],"search":[27,118],"algorithms":[28,104],"find":[30,49,91],"such":[31],"substructures":[34,52],"of":[35,101,110,125],"an":[36],"arbitrary":[37],"LDPC":[38],"code":[39],"given":[40],"its":[41],"matrix.":[43],"One":[44],"algorithm":[45,86,119],"is":[46,87],"guaranteed":[47],"including":[53],"stopping":[54],"sets,":[55,57,60],"trapping":[56],"and":[58,72],"absorbing":[59,93],"which":[61],"have":[62],"no":[63],"more":[64,106],"than":[65,113],"\u03b1":[66],"<sub":[67,76],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[68,77],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">max</sub>":[69,78],"variable":[70],"nodes":[71],"up":[73],"b":[75],"induced":[79],"odd-degree":[80],"neighboring":[81],"check":[82],"nodes.":[83],"The":[84],"other":[85],"specially":[88],"designed":[89],"fully":[92],"sets":[94],"(FAS).":[95],"Numerical":[96],"results":[97],"show":[98],"that":[99],"both":[100],"our":[102],"proposed":[103,116],"are":[105],"efficient":[107],"terms":[109],"execution":[111],"time":[112],"another":[114],"recently":[115],"[13].":[120],"Moreover,":[121],"by":[122],"properly":[123],"initialization":[124],"the":[126,128],"algorithm,":[127],"efficiency":[129],"can":[130],"further":[132],"improved":[133],"for":[134],"quasi-cyclic":[135],"(QC)":[136],"codes.":[137]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}