{"id":"https://openalex.org/W2088497038","doi":"https://doi.org/10.1109/istc.2014.6955074","title":"Randomly punctured spatially coupled LDPC codes","display_name":"Randomly punctured spatially coupled LDPC codes","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2088497038","doi":"https://doi.org/10.1109/istc.2014.6955074","mag":"2088497038"},"language":"en","primary_location":{"id":"doi:10.1109/istc.2014.6955074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2014.6955074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","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/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":["Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA","[Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, 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/A5090066379","display_name":"Michael Lentmaier","orcid":"https://orcid.org/0000-0003-3549-1412"},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Michael Lentmaier","raw_affiliation_strings":["Dept. of Electrical and Information Technology, Lund University, Lund, Sweden","Department of Electrical & Information Technology, Lund University, Lund, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Information Technology, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Department of Electrical & Information Technology, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059780057","display_name":"Al\u00ed Emre Pusane","orcid":"https://orcid.org/0000-0002-8412-6684"},"institutions":[{"id":"https://openalex.org/I4405392","display_name":"Bo\u011fazi\u00e7i University","ror":"https://ror.org/03z9tma90","country_code":"TR","type":"education","lineage":["https://openalex.org/I4405392"]}],"countries":["TR"],"is_corresponding":false,"raw_author_name":"Ali E. Pusane","raw_affiliation_strings":["Dept. of Electrical and Electronics Engineering, Bogazici University, Istanbul, Turkey","Department of Electrical and Electronics Engineering, Bo\u011fazi\u00e7i University, \u0130stanbul, Turkey#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Electronics Engineering, Bogazici University, Istanbul, Turkey","institution_ids":["https://openalex.org/I4405392"]},{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Bo\u011fazi\u00e7i University, \u0130stanbul, Turkey#TAB#","institution_ids":["https://openalex.org/I4405392"]}]},{"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":["Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA","[Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, University of Notre Dame, Notre Dame, Indiana, 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":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9976999759674072,"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.9970999956130981,"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/puncturing","display_name":"Puncturing","score":0.9758217334747314},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.9417773485183716},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7278367877006531},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6958317756652832},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5792019367218018},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5697560906410217},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5238677859306335},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49560487270355225},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3870903551578522},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.35536015033721924},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.2292848527431488},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1686277985572815},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07381963729858398}],"concepts":[{"id":"https://openalex.org/C2778808095","wikidata":"https://www.wikidata.org/wiki/Q3899825","display_name":"Puncturing","level":2,"score":0.9758217334747314},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9417773485183716},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7278367877006531},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6958317756652832},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5792019367218018},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5697560906410217},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5238677859306335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49560487270355225},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3870903551578522},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.35536015033721924},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2292848527431488},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1686277985572815},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07381963729858398},{"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/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/istc.2014.6955074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2014.6955074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 8th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322626","display_name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ft\u0131rma Kurumu","ror":"https://ror.org/04w9kkr77"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1864365761","https://openalex.org/W1991528082","https://openalex.org/W2021853814","https://openalex.org/W2123119950","https://openalex.org/W2128765501","https://openalex.org/W2136923821","https://openalex.org/W2137787303","https://openalex.org/W2144336593","https://openalex.org/W2150870540","https://openalex.org/W2154315166","https://openalex.org/W2160647929","https://openalex.org/W2165104588","https://openalex.org/W2179644698","https://openalex.org/W2535577585","https://openalex.org/W4300188436","https://openalex.org/W6603727012","https://openalex.org/W6639160788"],"related_works":["https://openalex.org/W2133440869","https://openalex.org/W2152494507","https://openalex.org/W2546305429","https://openalex.org/W2156055959","https://openalex.org/W2015836187","https://openalex.org/W2088497038","https://openalex.org/W2538326137","https://openalex.org/W1627814422","https://openalex.org/W2242182868","https://openalex.org/W2065071381"],"abstract_inverted_index":{"In":[0],"this":[1,71],"paper,":[2],"we":[3,118],"study":[4],"random":[5,35],"puncturing":[6,36],"of":[7,29,63,89],"protograph-based":[8],"spatially":[9],"coupled":[10],"low-density":[11],"parity-check":[12],"(SC-LDPC)":[13],"code":[14,32,66,79,106,111],"ensembles.":[15],"We":[16,68,91],"show":[17,74,100],"that,":[18,101],"with":[19],"respect":[20],"to":[21,73],"iterative":[22,60],"decoding":[23,61,127],"threshold,":[24],"the":[25,38,57,64,103,108,125,131],"strength":[26],"and":[27,59,99],"suitability":[28],"an":[30,94],"LDPC":[31],"ensemble":[33],"for":[34,85],"over":[37],"binary":[39],"erasure":[40],"channel":[41],"(BEC)":[42],"is":[43],"completely":[44],"determined":[45],"by":[46,130],"a":[47,86],"single":[48],"constant":[49],"\u03b8":[50],"\u2265":[51],"1":[52],"that":[53,75,123],"depends":[54],"only":[55],"on":[56],"rate":[58],"threshold":[62],"mother":[65,105],"ensemble.":[67],"then":[69],"use":[70],"analysis":[72,98],"randomly":[76],"punctured":[77,109],"SC-LDPC":[78,104,110],"ensembles":[80,112],"display":[81],"near":[82],"capacity":[83],"thresholds":[84],"wide":[87],"range":[88],"rates.":[90],"also":[92,114],"perform":[93],"asymptotic":[95,132],"minimum":[96],"distance":[97],"like":[102],"ensemble,":[107],"are":[113],"asymptotically":[115],"good.":[116],"Finally,":[117],"present":[119],"some":[120],"simulation":[121],"results":[122],"confirm":[124],"excellent":[126],"performance":[128],"promised":[129],"results.":[133]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
