{"id":"https://openalex.org/W2053106141","doi":"https://doi.org/10.1109/istc.2014.6955088","title":"Improving the finite-length performance of long SC-LDPC code chains by connecting consecutive chains","display_name":"Improving the finite-length performance of long SC-LDPC code chains by connecting consecutive chains","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2053106141","doi":"https://doi.org/10.1109/istc.2014.6955088","mag":"2053106141"},"language":"en","primary_location":{"id":"doi:10.1109/istc.2014.6955088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2014.6955088","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/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, Madrid, Spain","[Signal Theory and Communications Dept., University of Carlos III in Madrid, Spain]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Signal Theory and Communications Dept., University of Carlos III, Madrid, Spain","institution_ids":["https://openalex.org/I50357001"]},{"raw_affiliation_string":"[Signal Theory and Communications Dept., University of Carlos III in Madrid, 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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EE Dept., University of Notre Dame, Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043896274","display_name":"Dmitry Truhachev","orcid":null},"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":"Dmitry Truhachev","raw_affiliation_strings":["ECE Dept., Dalhousie University, Halifax, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ECE Dept., Dalhousie University, Halifax, 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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"EE Dept., 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":1.1039,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76051591,"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":"72","last_page":"76"},"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.9973999857902527,"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.9925000071525574,"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.9049757122993469},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7754247188568115},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.6463875770568848},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6376006007194519},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.6010878086090088},{"id":"https://openalex.org/keywords/chain","display_name":"Chain (unit)","score":0.5822017788887024},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5264473557472229},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5171400904655457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4909270107746124},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4219413995742798},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.39567816257476807},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28283220529556274},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.17241239547729492},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.12427020072937012},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.11323150992393494}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9049757122993469},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7754247188568115},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.6463875770568848},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6376006007194519},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.6010878086090088},{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.5822017788887024},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5264473557472229},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5171400904655457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4909270107746124},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4219413995742798},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.39567816257476807},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28283220529556274},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.17241239547729492},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.12427020072937012},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.11323150992393494},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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":1,"locations":[{"id":"doi:10.1109/istc.2014.6955088","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc.2014.6955088","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":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1972036717","https://openalex.org/W1985327182","https://openalex.org/W2004973997","https://openalex.org/W2039061708","https://openalex.org/W2115104320","https://openalex.org/W2123119950","https://openalex.org/W2141709486","https://openalex.org/W2162346886","https://openalex.org/W2179644698","https://openalex.org/W3100523383","https://openalex.org/W3106281662","https://openalex.org/W3125334338","https://openalex.org/W6786626451"],"related_works":["https://openalex.org/W2368824897","https://openalex.org/W1508050556","https://openalex.org/W1910862367","https://openalex.org/W2379365082","https://openalex.org/W2370747590","https://openalex.org/W2030109976","https://openalex.org/W2369260257","https://openalex.org/W2389120450","https://openalex.org/W55249799","https://openalex.org/W2540115800"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,20,77,83,92,104,118,129,132],"novel":[3],"encoding/transmission":[4],"scheme":[5],"called":[6],"continuous":[7,105],"chain":[8,46,136],"(CC)":[9],"transmission":[10,71,112],"that":[11,34,110],"is":[12,41,59],"able":[13],"to":[14,57,128],"improve":[15],"the":[16,35,49,67],"finite-length":[17],"performance":[18],"of":[19,37,69,75,79],"system":[21,130],"using":[22],"long":[23,84],"spatially":[24],"coupled":[25],"low-density":[26],"parity-check":[27],"(SC-LDPC)":[28],"code":[29,39,135],"chains.":[30,64],"First,":[31],"we":[32,87,108],"show":[33,109],"decoding":[36,99,122],"SC-LDPC":[38,85,134],"chains":[40,90],"more":[42,60],"reliable":[43],"for":[44,62,137],"shorter":[45,63],"lengths,":[47],"i.e.,":[48],"scaling":[50],"between":[51],"block":[52],"error":[53],"rate":[54],"and":[55,98],"gap":[56],"threshold":[58],"favorable":[61],"This":[65],"motivates":[66],"use":[68],"CC":[70,111],"in":[72,91,103,121],"which,":[73],"instead":[74],"transmitting":[76],"sequence":[78],"independent":[80],"codewords":[81],"from":[82],"chain,":[86],"connect":[88],"multiple":[89],"layered":[93],"format,":[94],"where":[95],"encoding,":[96],"transmission,":[97],"are":[100],"now":[101],"performed":[102],"fashion.":[106],"Finally,":[107],"can":[113],"be":[114],"implemented":[115],"with":[116,126],"only":[117],"small":[119],"increase":[120],"complexity":[123],"or":[124],"delay":[125],"respect":[127],"employing":[131],"single":[133],"transmission.":[138]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}