{"id":"https://openalex.org/W2004973997","doi":"https://doi.org/10.1109/itw.2013.6691239","title":"A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains","display_name":"A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2004973997","doi":"https://doi.org/10.1109/itw.2013.6691239","mag":"2004973997"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2013.6691239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2013.6691239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5066828138","display_name":"Pablo M. Olmos","orcid":"https://orcid.org/0000-0003-4276-5178"},"institutions":[{"id":"https://openalex.org/I50357001","display_name":"Universidad Carlos III de Madrid","ror":"https://ror.org/03ths8210","country_code":"ES","type":"education","lineage":["https://openalex.org/I50357001"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Pablo M. Olmos","raw_affiliation_strings":["Signal Theory and Communications Dept., University of Carlos III in Madrid, Spain","Signal Theor. & Commun. Dept., Univ. Carlos III of Madrid, Leganes, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signal Theory and Communications Dept., University of Carlos III in Madrid, Spain","institution_ids":["https://openalex.org/I50357001"]},{"raw_affiliation_string":"Signal Theor. & Commun. Dept., Univ. Carlos III of Madrid, Leganes, Spain","institution_ids":["https://openalex.org/I50357001"]}]},{"author_position":"middle","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":false,"raw_author_name":"David G. M. Mitchell","raw_affiliation_strings":["EE Dept., University of Notre Dame, Notre Dame, Indiana, USA","EE Department, University of Notre Dame, Notre Dame, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EE Dept., University of Notre Dame, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"EE Department, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032638568","display_name":"Dmitri Truhachev","orcid":"https://orcid.org/0000-0002-4455-3825"},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"education","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Dmitri Truhachev","raw_affiliation_strings":["ECE Dept., Dalhousie University, Halifax, Canada","ECE Dept., Dalhousie Univ., Halifax, NS, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Dept., Dalhousie University, Halifax, Canada","institution_ids":["https://openalex.org/I129902397"]},{"raw_affiliation_string":"ECE Dept., Dalhousie Univ., Halifax, NS, Canada","institution_ids":["https://openalex.org/I129902397"]}]},{"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":["EE Dept., University of Notre Dame, Notre Dame, Indiana, USA","EE Department, University of Notre Dame, Notre Dame, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EE Dept., University of Notre Dame, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"EE Department, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0733,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.74456125,"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":"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":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.9950000047683716,"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.992900013923645,"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.9161046743392944},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7248368263244629},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7221301198005676},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.681081235408783},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5086029767990112},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4583008885383606},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4387856721878052},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.42793336510658264},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4213160276412964},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.416951060295105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38181185722351074},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3801998794078827},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.33593758940696716},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3241253197193146},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.3230663537979126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2717817425727844},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.2537652850151062},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11607691645622253},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.11023247241973877}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9161046743392944},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7248368263244629},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7221301198005676},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.681081235408783},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5086029767990112},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4583008885383606},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4387856721878052},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.42793336510658264},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4213160276412964},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.416951060295105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38181185722351074},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3801998794078827},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.33593758940696716},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3241253197193146},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.3230663537979126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2717817425727844},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2537652850151062},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11607691645622253},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.11023247241973877},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2013.6691239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2013.6691239","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1985327182","https://openalex.org/W1991528082","https://openalex.org/W1996309336","https://openalex.org/W2114673995","https://openalex.org/W2115104320","https://openalex.org/W2123119950","https://openalex.org/W2128765501","https://openalex.org/W2162346886","https://openalex.org/W2172679141","https://openalex.org/W3125530803","https://openalex.org/W4300188436"],"related_works":["https://openalex.org/W2127041286","https://openalex.org/W1578469290","https://openalex.org/W2058270204","https://openalex.org/W2562604501","https://openalex.org/W2152303560","https://openalex.org/W3102111690","https://openalex.org/W2033432826","https://openalex.org/W2169426742","https://openalex.org/W2004973997","https://openalex.org/W2141572292"],"abstract_inverted_index":{"The":[0,31],"finite":[1],"length":[2],"performance":[3,67],"of":[4,33,37,72],"codes":[5],"on":[6],"graphs":[7],"constructed":[8],"by":[9],"connecting":[10],"spatially":[11],"coupled":[12],"low-density":[13],"parity-check":[14],"(SC-LDPC)":[15],"code":[16],"chains":[17],"is":[18,23,45,52],"analyzed.":[19],"Successive":[20],"(peeling)":[21],"decoding":[22,60],"considered":[24],"for":[25],"the":[26,34,38,73],"binary":[27],"erasure":[28],"channel":[29],"(BEC).":[30],"evolution":[32],"undecoded":[35],"portion":[36],"bipartite":[39],"graph":[40],"remaining":[41],"after":[42],"each":[43],"iteration":[44],"analyzed":[46],"as":[47],"a":[48],"dynamical":[49],"system.":[50],"It":[51],"shown":[53],"that,":[54],"in":[55],"addition":[56],"to":[57],"superior":[58],"iterative":[59],"thresholds,":[61],"connected":[62],"chain":[63,70],"ensembles":[64,71],"have":[65],"better":[66],"than":[68],"single":[69],"same":[74],"rate":[75],"and":[76],"length.":[77]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}