{"id":"https://openalex.org/W2138552636","doi":"https://doi.org/10.1109/ita.2013.6502981","title":"An efficient exhaustive low-weight codeword search for structured LDPC codes","display_name":"An efficient exhaustive low-weight codeword search for structured LDPC codes","publication_year":2013,"publication_date":"2013-02-01","ids":{"openalex":"https://openalex.org/W2138552636","doi":"https://doi.org/10.1109/ita.2013.6502981","mag":"2138552636"},"language":"en","primary_location":{"id":"doi:10.1109/ita.2013.6502981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2013.6502981","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Information Theory and Applications Workshop (ITA)","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/A5056339508","display_name":"Seyed Mehrdad Khatami","orcid":null},"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":true,"raw_author_name":"S. M. Khatami","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA","Department of Electrical & Computer Engineering, University of Arizona, Tucson, AZ 85721 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Arizona, Tucson, AZ 85721 USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042446995","display_name":"Ludovic Danjean","orcid":null},"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":"L. Danjean","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA","Department of Electrical & Computer Engineering, University of Arizona, Tucson, AZ 85721 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Arizona, Tucson, AZ 85721 USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007318007","display_name":"Danny Nguyen","orcid":"https://orcid.org/0000-0002-1695-4242"},"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":"D. V. Nguyen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA","Department of Electrical & Computer Engineering, University of Arizona, Tucson, AZ 85721 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Arizona, Tucson, AZ 85721 USA","institution_ids":["https://openalex.org/I138006243"]}]},{"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":"B. Vasic","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA","Department of Electrical & Computer Engineering, University of Arizona, Tucson, AZ 85721 USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Department of Electrical & Computer Engineering, University of Arizona, Tucson, AZ 85721 USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5056339508"],"corresponding_institution_ids":["https://openalex.org/I138006243"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.1861609,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"53","issue":null,"first_page":"1","last_page":"10"},"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.9983000159263611,"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.9815999865531921,"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.8876836895942688},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.7183330059051514},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5530039072036743},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5252028107643127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.486227422952652},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4523724317550659},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4510098397731781},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44451743364334106},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.43894442915916443},{"id":"https://openalex.org/keywords/trapping","display_name":"Trapping","score":0.4252511262893677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4217834770679474},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.4184040129184723},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36652886867523193},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3510972559452057},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.07796227931976318},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07713675498962402}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8876836895942688},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.7183330059051514},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5530039072036743},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5252028107643127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.486227422952652},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4523724317550659},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4510098397731781},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44451743364334106},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.43894442915916443},{"id":"https://openalex.org/C2777924906","wikidata":"https://www.wikidata.org/wiki/Q34168","display_name":"Trapping","level":2,"score":0.4252511262893677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4217834770679474},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.4184040129184723},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36652886867523193},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3510972559452057},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.07796227931976318},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07713675498962402},{"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ita.2013.6502981","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2013.6502981","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Information Theory and Applications Workshop (ITA)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.306.7182","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.306.7182","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ita.ucsd.edu/workshop/13/files/paper/paper_273.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W1484692004","https://openalex.org/W1536493828","https://openalex.org/W1542670990","https://openalex.org/W1571565904","https://openalex.org/W1667880265","https://openalex.org/W1973338115","https://openalex.org/W1973712217","https://openalex.org/W1976450468","https://openalex.org/W2008209264","https://openalex.org/W2032128222","https://openalex.org/W2041324282","https://openalex.org/W2071304218","https://openalex.org/W2098652101","https://openalex.org/W2102792260","https://openalex.org/W2107621627","https://openalex.org/W2107804146","https://openalex.org/W2110841034","https://openalex.org/W2111319461","https://openalex.org/W2113113053","https://openalex.org/W2114075878","https://openalex.org/W2115116691","https://openalex.org/W2118012216","https://openalex.org/W2121606987","https://openalex.org/W2128037788","https://openalex.org/W2128765501","https://openalex.org/W2130332106","https://openalex.org/W2133068391","https://openalex.org/W2142818093","https://openalex.org/W2143965786","https://openalex.org/W2155585954","https://openalex.org/W2161709113","https://openalex.org/W2553702736","https://openalex.org/W2987657883","https://openalex.org/W3122083751","https://openalex.org/W3125301056","https://openalex.org/W4285719527","https://openalex.org/W6628810906","https://openalex.org/W6634121476","https://openalex.org/W6677164909","https://openalex.org/W6683844217"],"related_works":["https://openalex.org/W2090897912","https://openalex.org/W2150639697","https://openalex.org/W4302175014","https://openalex.org/W1526609637","https://openalex.org/W2952823298","https://openalex.org/W2122913048","https://openalex.org/W2996745071","https://openalex.org/W2083917443","https://openalex.org/W2160848826","https://openalex.org/W2123902168"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4,76],"an":[5,37,83],"algorithm":[6,102,130],"to":[7,31,113,121,135],"find":[8],"all":[9,110],"low-weight":[10,34,141],"codewords":[11,111,142],"in":[12,77,105],"a":[13,22,33,78,114,122],"given":[14],"quasi-cyclic":[15],"(QC)":[16],"low-density":[17],"parity-check":[18],"(LDPC)":[19],"code":[20,79,92,107,123],"with":[21,87,124,143],"fixed":[23],"column-weight":[24],"and":[25,42],"girth.":[26],"The":[27,60,129],"main":[28],"idea":[29],"is":[30],"view":[32],"codeword":[35],"as":[36],"(a,":[38,49],"0)":[39,50],"trapping":[40,51,58,74,145],"sets,":[41],"then":[43],"show":[44],"that":[45,104],"each":[46],"topologically":[47],"different":[48,144],"set":[52,146],"can":[53,131],"be":[54,132],"dissected":[55],"into":[56],"smaller":[57,73],"sets.":[59],"proposed":[61],"search":[62],"method":[63],"relies":[64],"on":[65],"the":[66,88,101,106,125,137,140],"knowledge":[67],"of":[68,71,98,139],"possible":[69],"topologies":[70],"such":[72],"sets":[75],"ensemble,":[80],"which":[81,94,119],"enables":[82],"efficient":[84],"search.":[85],"Combined":[86],"high-rate":[89],"QC":[90],"LDPC":[91],"construction":[93,108],"successively":[95],"adds":[96],"blocks":[97],"permutation":[99],"matrices,":[100],"ensures":[103],"procedure":[109],"up":[112],"certain":[115],"weight":[116],"are":[117],"avoided,":[118],"leads":[120],"desired":[126],"minimum":[127],"distance.":[128],"also":[133],"used":[134],"determine":[136],"multiplicity":[138],"structure.":[147]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}