{"id":"https://openalex.org/W2026432105","doi":"https://doi.org/10.1109/cig.2010.5592641","title":"Quasi-cyclic asymptotically regular LDPC codes","display_name":"Quasi-cyclic asymptotically regular LDPC codes","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2026432105","doi":"https://doi.org/10.1109/cig.2010.5592641","mag":"2026432105"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2010.5592641","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2010.5592641","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Information Theory Workshop","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1007.0404","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076523933","display_name":"David G. M. Mitchell","orcid":"https://orcid.org/0000-0002-3544-9225"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D.G.M. Mitchell","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","[Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"[Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA]","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061445419","display_name":"Roxana Smarandache","orcid":"https://orcid.org/0000-0001-9085-5974"},"institutions":[{"id":"https://openalex.org/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Smarandache","raw_affiliation_strings":["Department of Mathematics and Statistics, San Diego State University, San Diego, CA, USA","Department of Mathematics and Statistics San Diego State University San Diego California USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]},{"raw_affiliation_string":"Department of Mathematics and Statistics San Diego State University San Diego California USA","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090066379","display_name":"Michael Lentmaier","orcid":"https://orcid.org/0000-0003-3549-1412"},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"TU Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]},{"id":"https://openalex.org/I245417339","display_name":"Vodafone (Germany)","ror":"https://ror.org/044qwkx83","country_code":"DE","type":"company","lineage":["https://openalex.org/I245417339","https://openalex.org/I74316835"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M. Lentmaier","raw_affiliation_strings":["Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany","Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden Germany"],"affiliations":[{"raw_affiliation_string":"Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany","institution_ids":["https://openalex.org/I245417339"]},{"raw_affiliation_string":"Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","[Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"[Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA]","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5076523933"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.3725,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.63948353,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9966999888420105,"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.8231145143508911},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6869138479232788},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5951690673828125},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5736261606216431},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5702229142189026},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5662492513656616},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5426320433616638},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5222971439361572},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5126949548721313},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.48288965225219727},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.4743061065673828},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.47191885113716125},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.46923428773880005},{"id":"https://openalex.org/keywords/cyclic-code","display_name":"Cyclic code","score":0.46318554878234863},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4196988344192505},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3761826157569885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31208309531211853},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.30648449063301086}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8231145143508911},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6869138479232788},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5951690673828125},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5736261606216431},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5702229142189026},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5662492513656616},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5426320433616638},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5222971439361572},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5126949548721313},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48288965225219727},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.4743061065673828},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.47191885113716125},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.46923428773880005},{"id":"https://openalex.org/C2096984","wikidata":"https://www.wikidata.org/wiki/Q245464","display_name":"Cyclic code","level":5,"score":0.46318554878234863},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4196988344192505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3761826157569885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31208309531211853},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.30648449063301086},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/cig.2010.5592641","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2010.5592641","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Information Theory Workshop","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1007.0404","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1007.0404","pdf_url":"https://arxiv.org/pdf/1007.0404","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.185.3043","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.3043","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.vodafone-chair.com/publications/2010/Lentmaier_M_ITW_10.pdf","raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:436fe81f-34bc-48e7-a85b-2e093b2cd99a","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/3731200","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"contributiontobookanthology/conference"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1007.0404","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1007.0404","pdf_url":"https://arxiv.org/pdf/1007.0404","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1534696366","https://openalex.org/W1571565904","https://openalex.org/W1618499549","https://openalex.org/W1667880265","https://openalex.org/W1676391945","https://openalex.org/W1820328018","https://openalex.org/W1973712217","https://openalex.org/W1976430875","https://openalex.org/W1991528082","https://openalex.org/W2071304218","https://openalex.org/W2073081764","https://openalex.org/W2123119950","https://openalex.org/W2128765501","https://openalex.org/W2132161120","https://openalex.org/W2136923821","https://openalex.org/W2147776616","https://openalex.org/W3105422132","https://openalex.org/W3125301056","https://openalex.org/W3125530803","https://openalex.org/W4256170753","https://openalex.org/W4300188436","https://openalex.org/W6603727012"],"related_works":["https://openalex.org/W2460434904","https://openalex.org/W2111330432","https://openalex.org/W2157171589","https://openalex.org/W2740543340","https://openalex.org/W1557234699","https://openalex.org/W2290229330","https://openalex.org/W1964096323","https://openalex.org/W2060869465","https://openalex.org/W2364890299","https://openalex.org/W2125647673"],"abstract_inverted_index":{"Families":[0],"of":[1,29,69,74,89,91,101,127,133],"asymptotically":[2],"regular":[3],"LDPC":[4,16,30],"block":[5,31,44],"code":[6,32,36,108],"ensembles":[7,33,58],"can":[8,95,121],"be":[9,96,122],"formed":[10],"by":[11,98,124],"terminating":[12],"(J,":[13],"K)-regular":[14],"protograph-based":[15],"convolutional":[17],"codes.":[18],"By":[19],"varying":[20,35],"the":[21,53,56,67,70,85,92,102,107,114,118,134],"termination":[22],"length,":[23,45],"we":[24,65,111],"obtain":[25],"a":[26,130],"large":[27],"selection":[28],"with":[34,43],"rates,":[37],"minimum":[38,86,119],"distance":[39,88,120],"that":[40,55,80,113],"grows":[41],"linearly":[42],"and":[46],"capacity":[47],"approaching":[48],"iterative":[49],"decoding":[50],"thresholds,":[51],"despite":[52],"fact":[54],"terminated":[57],"are":[59],"almost":[60],"regular.":[61],"In":[62],"this":[63],"paper,":[64],"investigate":[66],"properties":[68],"quasi-cyclic":[71],"(QC)":[72],"members":[73,90],"such":[75],"an":[76,81],"ensemble.":[77],"We":[78],"show":[79,112],"upper":[82,115],"bound":[83,116],"on":[84,117],"Hamming":[87],"QC":[93],"sub-ensemble":[94],"improved":[97,123],"careful":[99],"choice":[100],"component":[103],"protographs":[104],"used":[105],"in":[106,129],"construction.":[109],"Further,":[110],"using":[125],"arrays":[126],"circulants":[128],"graph":[131],"cover":[132],"protograph.":[135]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}