{"id":"https://openalex.org/W2117284614","doi":"https://doi.org/10.1109/isit.2014.6874961","title":"Analyzing finite-length protograph-based spatially coupled LDPC codes","display_name":"Analyzing finite-length protograph-based spatially coupled LDPC codes","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2117284614","doi":"https://doi.org/10.1109/isit.2014.6874961","mag":"2117284614"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6874961","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874961","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","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/A5041376310","display_name":"Markus Stinner","orcid":null},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Markus Stinner","raw_affiliation_strings":["Institute for Communications Engineering, Technische Universit\u00e4t, M\u00fcnchen, Germany","Inst. for Commun. Eng., Tech. Univ. Munchen, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering, Technische Universit\u00e4t, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Inst. for Commun. Eng., Tech. Univ. Munchen, Munich, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066828138","display_name":"Pablo M. Olmos","orcid":"https://orcid.org/0000-0003-4276-5178"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]},{"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":["DE","ES"],"is_corresponding":false,"raw_author_name":"Pablo M. Olmos","raw_affiliation_strings":["Institute for Communications Engineering, Technische Universit\u00e4t, M\u00fcnchen, Germany","Dept. de Teor. de la Senal y Comun., Univ. Carlos III de Madrid, Legane\u0301s, Spain"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering, Technische Universit\u00e4t, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]},{"raw_affiliation_string":"Dept. de Teor. de la Senal y Comun., Univ. Carlos III de Madrid, Legane\u0301s, Spain","institution_ids":["https://openalex.org/I50357001"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041376310"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":2.5089,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.90771199,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"891","last_page":"895"},"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.9976000189781189,"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.9962999820709229,"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.9347550868988037},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6749443411827087},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6597978472709656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5585529804229736},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43706029653549194},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43515855073928833},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4248022437095642},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.24347254633903503},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1327837109565735},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.12826713919639587}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9347550868988037},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6749443411827087},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6597978472709656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5585529804229736},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43706029653549194},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43515855073928833},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4248022437095642},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.24347254633903503},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1327837109565735},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.12826713919639587},{"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/isit.2014.6874961","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874961","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","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":12,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1536930200","https://openalex.org/W1985327182","https://openalex.org/W2108957380","https://openalex.org/W2115104320","https://openalex.org/W2123119950","https://openalex.org/W2136923821","https://openalex.org/W2139012746","https://openalex.org/W2162346886","https://openalex.org/W3106281662","https://openalex.org/W6603727012","https://openalex.org/W6786626451"],"related_works":["https://openalex.org/W2115811863","https://openalex.org/W2156055959","https://openalex.org/W2372190485","https://openalex.org/W1848880869","https://openalex.org/W2139769859","https://openalex.org/W1525070854","https://openalex.org/W2583282232","https://openalex.org/W1568966867","https://openalex.org/W1656451834","https://openalex.org/W4386075170"],"abstract_inverted_index":{"The":[0],"peeling":[1],"decoding":[2,50,54],"for":[3,12,37,93],"spatially":[4],"coupled":[5,61],"low-density":[6],"parity-check":[7],"(SC-LDPC)":[8],"codes":[9,31,70],"is":[10,32,45],"analyzed":[11],"a":[13,75],"binary":[14],"erasure":[15],"channel.":[16],"An":[17],"analytical":[18],"calculation":[19],"of":[20,24,28,41,60],"the":[21,38,48,53,58,85,89],"mean":[22],"evolution":[23,40],"degree-one":[25,42],"check":[26,43],"nodes":[27,44],"protograph-based":[29],"SC-LDPC":[30,69,82],"given":[33,97],"and":[34,98],"an":[35],"estimate":[36],"covariance":[39],"proposed":[46],"in":[47],"stable":[49],"phase":[51],"where":[52],"wave":[55],"propagates":[56],"along":[57],"chain":[59],"codes.":[62,83],"Both":[63],"results":[64],"are":[65,96],"verified":[66,99],"numerically.":[67],"Protograph-based":[68],"turn":[71],"out":[72],"to":[73],"have":[74],"more":[76],"robust":[77],"behavior":[78],"than":[79],"unstructured":[80],"random":[81],"Using":[84],"analytically":[86],"calculated":[87],"parameters,":[88],"finite-length":[90],"scaling":[91],"laws":[92],"these":[94],"constructions":[95],"by":[100],"numerical":[101],"simulations.":[102]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}
