{"id":"https://openalex.org/W2890734459","doi":"https://doi.org/10.1109/itw.2018.8613507","title":"Free Pseudodistance Growth Rates for Spatially Coupled LDPC Codes over the BEC","display_name":"Free Pseudodistance Growth Rates for Spatially Coupled LDPC Codes over the BEC","publication_year":2018,"publication_date":"2018-11-01","ids":{"openalex":"https://openalex.org/W2890734459","doi":"https://doi.org/10.1109/itw.2018.8613507","mag":"2890734459"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2018.8613507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2018.8613507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Information Theory Workshop (ITW)","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/A5037980481","display_name":"Cunlu Zhou","orcid":"https://orcid.org/0000-0002-7648-1483"},"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":"Cunlu Zhou","raw_affiliation_strings":["Department of Mathematics, University of Notre Dame, Notre Dame, Indiana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Notre Dame, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"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/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G. M. Mitchell","raw_affiliation_strings":["Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, New Mexico, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, New Mexico, USA","institution_ids":["https://openalex.org/I10052268"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061445419","display_name":"Roxana Smarandache","orcid":"https://orcid.org/0000-0001-9085-5974"},"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":"Roxana Smarandache","raw_affiliation_strings":["Department of Mathematics, University of Notre Dame, Notre Dame, Indiana, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Notre Dame, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11682085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"45","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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.996999979019165,"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.9948999881744385,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9080345630645752},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6344128251075745},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.5414090752601624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.538664698600769},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5308469533920288},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.48119693994522095},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4728158712387085},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4708924889564514},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.46151918172836304},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4500312805175781},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4330149292945862},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3746032416820526},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3055148124694824},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12434616684913635},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05450662970542908}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9080345630645752},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6344128251075745},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.5414090752601624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.538664698600769},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5308469533920288},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.48119693994522095},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4728158712387085},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4708924889564514},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.46151918172836304},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4500312805175781},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4330149292945862},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3746032416820526},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3055148124694824},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12434616684913635},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05450662970542908},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2018.8613507","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2018.8613507","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1588943481","https://openalex.org/W1595640491","https://openalex.org/W1864365761","https://openalex.org/W1982045017","https://openalex.org/W1991528082","https://openalex.org/W2005457258","https://openalex.org/W2039544061","https://openalex.org/W2041324282","https://openalex.org/W2071304218","https://openalex.org/W2110148463","https://openalex.org/W2116815462","https://openalex.org/W2123119950","https://openalex.org/W2135573812","https://openalex.org/W2141709486","https://openalex.org/W2179644698","https://openalex.org/W2962897197","https://openalex.org/W6603727012","https://openalex.org/W6635197353","https://openalex.org/W6635539370"],"related_works":["https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2047069332","https://openalex.org/W2352157218","https://openalex.org/W4213381250","https://openalex.org/W2806845321","https://openalex.org/W2167713507","https://openalex.org/W2540115800","https://openalex.org/W2034110706","https://openalex.org/W1963637513"],"abstract_inverted_index":{"The":[0],"minimum":[1,62],"pseudoweight":[2,63],"is":[3],"an":[4],"important":[5],"parameter":[6],"related":[7],"to":[8,86],"the":[9,34,60,65,76,81,94,95,108,129,136],"decoding":[10],"performance":[11],"of":[12,25,42,64],"LDPC":[13,30],"codes":[14,32],"with":[15,75],"iterative":[16],"message-passing":[17],"decoding.":[18],"In":[19],"this":[20],"paper,":[21],"we":[22],"consider":[23],"ensembles":[24,54,72],"periodically":[26],"time-varying":[27],"spatially":[28],"coupled":[29],"(SC-LDPC)":[31],"and":[33,55,115],"pseudocodewords":[35],"arising":[36],"from":[37,103],"their":[38],"finite":[39],"graph":[40],"covers":[41],"a":[43,56,101,123],"fixed":[44,57],"degree.":[45],"We":[46,88],"show":[47,116],"that":[48,90,118],"for":[49,122,135],"certain":[50],"(J,K)-regular":[51],"SC-LDPC":[52,70,112,137],"code":[53,71,113],"cover":[58],"degree,":[59],"typical":[61],"unterminated":[66],"(and":[67],"associated":[68,109],"tail-biting/terminated)":[69],"grows":[73],"linearly":[74],"constraint":[77,82],"(block)":[78,83],"length":[79,84],"as":[80],"tends":[85],"infinity.":[87],"prove":[89],"one":[91],"can":[92],"bound":[93],"free":[96,131],"pseudodistance":[97,132],"growth":[98,133],"rate":[99,134],"over":[100],"BEC":[102],"below":[104],"(respectively,":[105],"above)":[106],"using":[107],"tail-biting":[110],"(terminated)":[111],"ensemble":[114,138],"empirically":[117],"these":[119],"bounds":[120],"coincide":[121],"sufficiently":[124],"large":[125],"period,":[126],"which":[127],"gives":[128],"exact":[130],"considered.":[139]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}