{"id":"https://openalex.org/W1627814422","doi":"https://doi.org/10.1109/isit.2015.7282489","title":"Approximating decoding thresholds of punctured LDPC code ensembles on the AWGN channel","display_name":"Approximating decoding thresholds of punctured LDPC code ensembles on the AWGN channel","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W1627814422","doi":"https://doi.org/10.1109/isit.2015.7282489","mag":"1627814422"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2015.7282489","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","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/7442621","any_repository_has_fulltext":true},"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":true,"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, Indiana, USA]"],"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, 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, Sweden"],"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, 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#"],"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, Indiana, USA]"],"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, Indiana, USA]","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5076523933"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.6656,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.72932164,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"421","last_page":"425"},"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.9987000226974487,"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.9894999861717224,"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.9572649598121643},{"id":"https://openalex.org/keywords/puncturing","display_name":"Puncturing","score":0.8652400970458984},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7617486715316772},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6648997068405151},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.6515291333198547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6451616287231445},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5161107778549194},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4877520203590393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4836224615573883},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4262756407260895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3900948166847229},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3534197211265564},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3381153345108032},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.20266932249069214},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.11690515279769897}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9572649598121643},{"id":"https://openalex.org/C2778808095","wikidata":"https://www.wikidata.org/wiki/Q3899825","display_name":"Puncturing","level":2,"score":0.8652400970458984},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7617486715316772},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6648997068405151},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.6515291333198547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6451616287231445},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5161107778549194},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4877520203590393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4836224615573883},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4262756407260895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3900948166847229},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3534197211265564},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3381153345108032},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.20266932249069214},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.11690515279769897},{"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2015.7282489","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2015.7282489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:lup.lub.lu.se:47c4372c-a92c-4352-83a1-498e846bf1d2","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/7442621","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":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:lup.lub.lu.se:47c4372c-a92c-4352-83a1-498e846bf1d2","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/7442621","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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1536930200","https://openalex.org/W1864365761","https://openalex.org/W2088497038","https://openalex.org/W2123119950","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/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,110],"paper,":[2],"we":[3,126],"provide":[4],"an":[5,85],"efficient":[6],"way":[7],"to":[8,97],"predict":[9],"iterative":[10,98],"belief":[11],"propagation":[12],"(BP)":[13],"decoding":[14,99,134],"thresholds":[15],"of":[16,38,74,84],"randomly":[17],"punctured":[18],"low-density":[19],"parity-check":[20],"(LDPC)":[21],"code":[22,41,51,87,118,123],"ensembles":[23],"on":[24,43],"the":[25,35,39,44,50,57,80,93,132,138],"binary-input":[26],"additive":[27],"white":[28],"Gaussian":[29],"noise":[30],"channel":[31,47],"(AWGNC),":[32],"given":[33],"only":[34],"BP":[36],"threshold":[37,100],"mother":[40],"ensemble":[42,88],"binary":[45],"erasure":[46],"(BEC)":[48],"and":[49,82,109,119],"design":[52],"rate.":[53],"We":[54,77],"show":[55],"that":[56,79,130],"predictions":[58],"are":[59],"accurate":[60],"by":[61,67,104,137],"comparing":[62],"them":[63],"with":[64,95],"values":[65],"calculated":[66],"discretized":[68],"density":[69],"evolution":[70],"for":[71,89],"a":[72,105],"variety":[73],"puncturing":[75,91],"fractions.":[76],"find":[78],"strength":[81],"suitability":[83],"LDPC":[86,116,122],"random":[90],"over":[92],"AWGNC":[94],"respect":[96],"is":[101,112],"completely":[102],"determined":[103],"single":[106],"constant":[107],"\u03b8,":[108],"behavior":[111],"demonstrated":[113],"using":[114],"both":[115],"block":[117],"spatially":[120],"coupled":[121],"ensembles.":[124],"Finally,":[125],"present":[127],"simulation":[128],"results":[129],"confirm":[131],"excellent":[133],"performance":[135],"promised":[136],"asymptotic":[139],"results.":[140]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}