{"id":"https://openalex.org/W2156991284","doi":"https://doi.org/10.1109/isit.2010.5513595","title":"On the thresholds of generalized LDPC convolutional codes based on protographs","display_name":"On the thresholds of generalized LDPC convolutional codes based on protographs","publication_year":2010,"publication_date":"2010-06-01","ids":{"openalex":"https://openalex.org/W2156991284","doi":"https://doi.org/10.1109/isit.2010.5513595","mag":"2156991284"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2010.5513595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lup.lub.lu.se/record/3731222","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090066379","display_name":"Michael Lentmaier","orcid":"https://orcid.org/0000-0003-3549-1412"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael Lentmaier","raw_affiliation_strings":["Dresden University of Technology, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Dresden University of Technology, Dresden, Germany","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022117288","display_name":"Gerhard Fettweis","orcid":"https://orcid.org/0000-0003-4622-1311"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerhard P. Fettweis","raw_affiliation_strings":["Dresden University of Technology, Dresden, Germany"],"affiliations":[{"raw_affiliation_string":"Dresden University of Technology, Dresden, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090066379"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":15.647,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.99290312,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9987999796867371,"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.9977999925613403,"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/convolutional-code","display_name":"Convolutional code","score":0.7498095631599426},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6525290012359619},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.6253941059112549},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6004050374031067},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5893296003341675},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5870579481124878},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5840179324150085},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.54550701379776},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5204946398735046},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4767785370349884},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.44764208793640137},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4380779564380646},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4169304370880127},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3394373059272766},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.33255064487457275},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.15742027759552002},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.14348828792572021},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.12726464867591858},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11542662978172302}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7498095631599426},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6525290012359619},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.6253941059112549},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6004050374031067},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5893296003341675},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5870579481124878},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5840179324150085},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54550701379776},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5204946398735046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4767785370349884},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.44764208793640137},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4380779564380646},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4169304370880127},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3394373059272766},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.33255064487457275},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.15742027759552002},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.14348828792572021},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.12726464867591858},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11542662978172302},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2010.5513595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2010.5513595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:lup.lub.lu.se:4439a164-8512-46be-b39b-07418b4820dd","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/3731222","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"contributiontobookanthology/conference"}],"best_oa_location":{"id":"pmh:oai:lup.lub.lu.se:4439a164-8512-46be-b39b-07418b4820dd","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/3731222","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"contributiontobookanthology/conference"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1618499549","https://openalex.org/W1903644624","https://openalex.org/W1976430875","https://openalex.org/W2074450800","https://openalex.org/W2076859597","https://openalex.org/W2097900809","https://openalex.org/W2100525102","https://openalex.org/W2114468914","https://openalex.org/W2115116691","https://openalex.org/W2123119950","https://openalex.org/W2149830059","https://openalex.org/W2167663246","https://openalex.org/W2410688423","https://openalex.org/W2418937273","https://openalex.org/W2542883056","https://openalex.org/W2949546585","https://openalex.org/W2952834582","https://openalex.org/W3125530803","https://openalex.org/W4292232932","https://openalex.org/W6603727012","https://openalex.org/W6639690886","https://openalex.org/W6714914520"],"related_works":["https://openalex.org/W1972318883","https://openalex.org/W2534582423","https://openalex.org/W2121305283","https://openalex.org/W2015741799","https://openalex.org/W2168862745","https://openalex.org/W3114701954","https://openalex.org/W1944343091","https://openalex.org/W1603044377","https://openalex.org/W2098086720","https://openalex.org/W1996737726"],"abstract_inverted_index":{"A":[0],"threshold":[1],"analysis":[2,50],"of":[3,20,62,71],"terminated":[4,36],"generalized":[5],"LDPC":[6],"convolutional":[7],"codes":[8,29],"(GLDPC":[9],"CCs)":[10],"is":[11,32],"presented":[12],"for":[13,53],"the":[14,35,57,67,72],"binary":[15],"erasure":[16],"channel.":[17],"Different":[18],"ensembles":[19],"protograph-based":[21],"GLDPC":[22],"CCs":[23,38,64],"are":[24],"considered,":[25],"including":[26],"braided":[27],"block":[28,44,75],"(BBCs).":[30],"It":[31],"shown":[33],"that":[34,52],"PG-GLDPC":[37,63,74],"have":[39],"better":[40],"thresholds":[41,61,70],"than":[42],"their":[43],"code":[45],"counterparts.":[46],"Surprisingly,":[47],"our":[48],"numerical":[49],"suggests":[51],"large":[54],"termination":[55],"factors":[56],"belief":[58],"propagation":[59],"decoding":[60,69],"coincide":[65],"with":[66],"ML":[68],"corresponding":[73],"codes.":[76]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}