{"id":"https://openalex.org/W2049194243","doi":"https://doi.org/10.1109/isit.2010.5513633","title":"New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes","display_name":"New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2049194243","doi":"https://doi.org/10.1109/isit.2010.5513633","mag":"2049194243"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513633","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1005.1065","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"David G. M. Mitchell","orcid":null},"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":"David G. M. Mitchell","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Michael Lentmaier","orcid":null},"institutions":[{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Lentmaier","raw_affiliation_strings":["Dresden University of Technology, Dresden, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dresden University of Technology, Dresden, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"author_position":"last","author":{"id":null,"display_name":"Daniel J. Costello","orcid":null},"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, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4675,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.80711268,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"824","last_page":"828"},"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.9954000115394592,"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.9898999929428101,"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.8517000079154968},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.599399983882904},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.5956000089645386},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5856999754905701},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5361999869346619},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5184999704360962},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4819999933242798},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4499000012874603},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4262999892234802}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8517000079154968},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.599399983882904},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.5956000089645386},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5856999754905701},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.557200014591217},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5361999869346619},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5184999704360962},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4819999933242798},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.461899995803833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4571000039577484},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4325999915599823},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4262999892234802},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.41370001435279846},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.3968999981880188},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3824999928474426},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.3666999936103821},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36410000920295715},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.3467999994754791},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3109000027179718},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.3109000027179718},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.27549999952316284},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.26330000162124634},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.2551000118255615},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.2549000084400177}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2010.5513633","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513633","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1005.1065","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1005.1065","pdf_url":"https://arxiv.org/pdf/1005.1065","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:lup.lub.lu.se:e20764cb-6c81-4b36-9597-44caf7a5f09f","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/3731217","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":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1005.1065","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1005.1065","pdf_url":"https://arxiv.org/pdf/1005.1065","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1676391945","https://openalex.org/W1820328018","https://openalex.org/W1976430875","https://openalex.org/W1984762281","https://openalex.org/W1991528082","https://openalex.org/W2073081764","https://openalex.org/W2085903266","https://openalex.org/W2115104320","https://openalex.org/W2123119950","https://openalex.org/W2128765501","https://openalex.org/W2136923821","https://openalex.org/W2165573107","https://openalex.org/W6714914520"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,43,83],"paper,":[2],"we":[3,76],"present":[4],"a":[5,32,50],"method":[6],"of":[7,11,53,70],"constructing":[8],"new":[9],"families":[10],"LDPC":[12,21,54],"block":[13,55,93],"code":[14,56,60],"ensembles":[15,57,81],"formed":[16],"by":[17,68],"terminating":[18],"irregular":[19],"protograph-based":[20],"convolutional":[22],"codes.":[23],"Using":[24],"the":[25,37,80],"accumulate-repeat-by-4-jagged-accumulate":[26],"(AR4JA)":[27],"protograph":[28],"as":[29],"an":[30,71],"example,":[31],"density":[33],"evolution":[34],"analysis":[35],"for":[36],"binary":[38],"erasure":[39],"channel":[40],"shows":[41],"that":[42,78,89],"flexible":[44],"design":[45],"technique":[46],"gives":[47],"rise":[48],"to":[49,65],"large":[51],"selection":[52],"with":[58,92],"varying":[59],"rates":[61],"and":[62],"thresholds":[63],"close":[64],"capacity.":[66],"Further,":[67],"means":[69],"asymptotic":[72],"weight":[73],"enumerator":[74],"analysis,":[75],"show":[77],"all":[79],"in":[82],"family":[84],"also":[85],"have":[86],"minimum":[87],"distance":[88],"grows":[90],"linearly":[91],"length,":[94],"i.e.,":[95],"they":[96],"are":[97],"asymptotically":[98],"good.":[99]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2016-06-24T00:00:00"}