{"id":"https://openalex.org/W2032128222","doi":"https://doi.org/10.1109/tit.2011.2173733","title":"On the Construction of Structured LDPC Codes Free of Small Trapping Sets","display_name":"On the Construction of Structured LDPC Codes Free of Small Trapping Sets","publication_year":2012,"publication_date":"2012-03-26","ids":{"openalex":"https://openalex.org/W2032128222","doi":"https://doi.org/10.1109/tit.2011.2173733","mag":"2032128222"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2011.2173733","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2011.2173733","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":true,"oa_status":"green","oa_url":"https://repository.arizona.edu/bitstream/10150/641976/1/On%20the%20Construction%20Of%20Structured%20LDPC%20Codes%20Free%20of%20Small%20Trapping%20Sets.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101751146","display_name":"Dung Viet Nguyen","orcid":"https://orcid.org/0000-0002-8927-2832"},"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":"Dung Viet Nguyen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043061449","display_name":"Shashi Kiran Chilappagari","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"]},{"id":"https://openalex.org/I4210154351","display_name":"Marvell (United States)","ror":"https://ror.org/04wmff902","country_code":"US","type":"company","lineage":["https://openalex.org/I4210092679","https://openalex.org/I4210154351"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shashi Kiran Chilappagari","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA","Marvell Semiconductors, Santa Clara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]},{"raw_affiliation_string":"Marvell Semiconductors, Santa Clara, CA, USA","institution_ids":["https://openalex.org/I4210154351"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045608934","display_name":"Michael W. Marcellin","orcid":"https://orcid.org/0000-0001-9606-134X"},"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":"Michael W. Marcellin","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, 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":"Bane Vasic","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Arizona Tucson, Tucson, AZ, USA","institution_ids":["https://openalex.org/I138006243"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101751146"],"corresponding_institution_ids":["https://openalex.org/I138006243"],"apc_list":null,"apc_paid":null,"fwci":20.3039,"has_fulltext":true,"cited_by_count":121,"citation_normalized_percentile":{"value":0.99512037,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":"58","issue":"4","first_page":"2280","last_page":"2302"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9973999857902527,"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.9972000122070312,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8736193180084229},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6707181930541992},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.666410505771637},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.6197659373283386},{"id":"https://openalex.org/keywords/permutation-matrix","display_name":"Permutation matrix","score":0.5454644560813904},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5325276851654053},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.5142928957939148},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5074190497398376},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.4708423316478729},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44294261932373047},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4283289313316345},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4004720449447632},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3820018470287323},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.338246613740921}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8736193180084229},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6707181930541992},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.666410505771637},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.6197659373283386},{"id":"https://openalex.org/C84140500","wikidata":"https://www.wikidata.org/wiki/Q851512","display_name":"Permutation matrix","level":3,"score":0.5454644560813904},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5325276851654053},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.5142928957939148},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5074190497398376},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.4708423316478729},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44294261932373047},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4283289313316345},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4004720449447632},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3820018470287323},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.338246613740921},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.0},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2011.2173733","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2011.2173733","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"},{"id":"pmh:oai:repository.arizona.edu:10150/641976","is_oa":true,"landing_page_url":"http://hdl.handle.net/10150/641976","pdf_url":"https://repository.arizona.edu/bitstream/10150/641976/1/On%20the%20Construction%20Of%20Structured%20LDPC%20Codes%20Free%20of%20Small%20Trapping%20Sets.pdf","source":{"id":"https://openalex.org/S4306400271","display_name":"UA Campus Repository (The University of Arizona)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138006243","host_organization_name":"University of Arizona","host_organization_lineage":["https://openalex.org/I138006243"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"2302","raw_type":"Article"}],"best_oa_location":{"id":"pmh:oai:repository.arizona.edu:10150/641976","is_oa":true,"landing_page_url":"http://hdl.handle.net/10150/641976","pdf_url":"https://repository.arizona.edu/bitstream/10150/641976/1/On%20the%20Construction%20Of%20Structured%20LDPC%20Codes%20Free%20of%20Small%20Trapping%20Sets.pdf","source":{"id":"https://openalex.org/S4306400271","display_name":"UA Campus Repository (The University of Arizona)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138006243","host_organization_name":"University of Arizona","host_organization_lineage":["https://openalex.org/I138006243"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"2302","raw_type":"Article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G201896119","display_name":"CIF: Medium: Iterative Decoding Beyond Belief Propagation","funder_award_id":"0963726","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6491906965","display_name":"TF08:  Error Correction Algorithms for DNA Repair: Inference, Analysis, and Intervention","funder_award_id":"0830245","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7990118436","display_name":null,"funder_award_id":"CCF-0963726","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"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2032128222.pdf","grobid_xml":"https://content.openalex.org/works/W2032128222.grobid-xml"},"referenced_works_count":79,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W152471750","https://openalex.org/W165604028","https://openalex.org/W1484692004","https://openalex.org/W1511646925","https://openalex.org/W1960964953","https://openalex.org/W1964402820","https://openalex.org/W1971082326","https://openalex.org/W1973712217","https://openalex.org/W2001732758","https://openalex.org/W2040845212","https://openalex.org/W2054540803","https://openalex.org/W2054649237","https://openalex.org/W2071304218","https://openalex.org/W2095882513","https://openalex.org/W2102792260","https://openalex.org/W2102920351","https://openalex.org/W2107621627","https://openalex.org/W2107804146","https://openalex.org/W2108588236","https://openalex.org/W2111895369","https://openalex.org/W2113420173","https://openalex.org/W2114075878","https://openalex.org/W2114869758","https://openalex.org/W2115193201","https://openalex.org/W2116815462","https://openalex.org/W2118012216","https://openalex.org/W2119017156","https://openalex.org/W2119990840","https://openalex.org/W2125250903","https://openalex.org/W2128765501","https://openalex.org/W2130255084","https://openalex.org/W2131498089","https://openalex.org/W2132161120","https://openalex.org/W2133068391","https://openalex.org/W2140798218","https://openalex.org/W2140953380","https://openalex.org/W2141572292","https://openalex.org/W2142415334","https://openalex.org/W2142818093","https://openalex.org/W2143965786","https://openalex.org/W2147776616","https://openalex.org/W2148981492","https://openalex.org/W2150570316","https://openalex.org/W2151875415","https://openalex.org/W2152474312","https://openalex.org/W2153344955","https://openalex.org/W2154297943","https://openalex.org/W2154993501","https://openalex.org/W2156541068","https://openalex.org/W2161288875","https://openalex.org/W2161709113","https://openalex.org/W2162312124","https://openalex.org/W2164592411","https://openalex.org/W2166478505","https://openalex.org/W2167291955","https://openalex.org/W2169033245","https://openalex.org/W2169732368","https://openalex.org/W2170998175","https://openalex.org/W2171555792","https://openalex.org/W2255377951","https://openalex.org/W2489161884","https://openalex.org/W2543622157","https://openalex.org/W2553702736","https://openalex.org/W2963637485","https://openalex.org/W2964312726","https://openalex.org/W3098387537","https://openalex.org/W3101070717","https://openalex.org/W3122083751","https://openalex.org/W4205545339","https://openalex.org/W4285719527","https://openalex.org/W4300188436","https://openalex.org/W6603727012","https://openalex.org/W6606175091","https://openalex.org/W6606763497","https://openalex.org/W6628810906","https://openalex.org/W6677164909","https://openalex.org/W6683844217","https://openalex.org/W6691857904"],"related_works":["https://openalex.org/W2090897912","https://openalex.org/W1968533815","https://openalex.org/W2351144917","https://openalex.org/W2142415334","https://openalex.org/W4206131153","https://openalex.org/W2951726353","https://openalex.org/W1526609637","https://openalex.org/W2150639697","https://openalex.org/W3087284767","https://openalex.org/W2122913048"],"abstract_inverted_index":{"We":[0,62,101],"present":[1],"a":[2,58,116,138,150,161],"method":[3,104],"to":[4,105,136,148,163],"construct":[5,106],"low-density":[6],"parity-check":[7,124],"(LDPC)":[8],"codes":[9,122],"with":[10],"low":[11],"error":[12],"floors":[13],"on":[14,53,88],"the":[15,40,45,64,72,77,85,93,112,157],"binary":[16],"symmetric":[17],"channel.":[18],"Codes":[19],"are":[20,27,37,50,126],"constructed":[21],"so":[22],"that":[23,143],"their":[24,54],"Tanner":[25,158],"graphs":[26],"free":[28,165],"of":[29,67,97,119,128,140,160,166],"certain":[30],"small":[31],"trapping":[32,35,41,69,90,99],"sets.":[33,100],"These":[34],"sets":[36,70],"selected":[38,51],"from":[39],"set":[42,91,139],"ontology":[43],"for":[44,57,71,156],"Gallager":[46],"A/B":[47],"decoder.":[48],"They":[49],"based":[52],"relative":[55,65],"harmfulness":[56,66],"given":[59],"decoding":[60,86],"algorithm.":[61],"evaluate":[63],"different":[68],"sum\u2013product":[73],"algorithm":[74],"by":[75,83],"using":[76],"topological":[78],"relations":[79],"among":[80],"them":[81],"and":[82,147,153],"analyzing":[84],"failures":[87],"one":[89],"in":[92],"presence":[94],"or":[95],"absence":[96],"other":[98],"apply":[102],"this":[103],"structured":[107,120],"LDPC":[108,121],"codes.":[109],"To":[110],"facilitate":[111],"discussion,":[113],"we":[114],"give":[115],"new":[117],"description":[118,132],"whose":[123],"matrices":[125,142],"arrays":[127],"permutation":[129,141],"matrices.":[130],"This":[131],"uses":[133],"Latin":[134],"squares":[135],"define":[137],"have":[144],"disjoint":[145],"support":[146],"derive":[149],"simple":[151],"necessary":[152],"sufficient":[154],"condition":[155],"graph":[159],"code":[162],"be":[164],"four":[167],"cycles.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":14}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}