{"id":"https://openalex.org/W2134247900","doi":"https://doi.org/10.1109/isit.2009.5205687","title":"Trapping set analysis of protograph-based LDPC convolutional codes","display_name":"Trapping set analysis of protograph-based LDPC convolutional codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2134247900","doi":"https://doi.org/10.1109/isit.2009.5205687","mag":"2134247900"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205687","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"D.G.M. Mitchell","raw_affiliation_strings":["Institute for Digital Communications, The University of Edinburgh, Scotland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Digital Communications, The University of Edinburgh, Scotland","institution_ids":["https://openalex.org/I98677209"]}]},{"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/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":"A.E. Pusane","raw_affiliation_strings":["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"]}]},{"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"]},{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB","US"],"is_corresponding":false,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","Institute for Digital Communications, The University of Edinburgh, Scotland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Institute for Digital Communications, The University of Edinburgh, Scotland","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"561","last_page":"565"},"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.9966999888420105,"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.9965999722480774,"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.8408944010734558},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.8202191591262817},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.7448984980583191},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6097890138626099},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5896621346473694},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5652492642402649},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5429853796958923},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5198305249214172},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.510242223739624},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4502420723438263},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.43775826692581177},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3653399348258972},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34648042917251587},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.23427370190620422}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8408944010734558},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.8202191591262817},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.7448984980583191},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6097890138626099},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5896621346473694},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5652492642402649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5429853796958923},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5198305249214172},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.510242223739624},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4502420723438263},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.43775826692581177},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3653399348258972},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34648042917251587},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.23427370190620422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2009.5205687","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320311518","display_name":"Heriot-Watt University","ror":"https://ror.org/04mghma93"},{"id":"https://openalex.org/F4320320064","display_name":"Scottish Funding Council","ror":"https://ror.org/056bwcz71"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1484692004","https://openalex.org/W1676391945","https://openalex.org/W1874908784","https://openalex.org/W1967290776","https://openalex.org/W1991528082","https://openalex.org/W2001732758","https://openalex.org/W2073081764","https://openalex.org/W2106958932","https://openalex.org/W2115116691","https://openalex.org/W2128765501","https://openalex.org/W2151356723","https://openalex.org/W2153344955","https://openalex.org/W2168300614","https://openalex.org/W4285719527","https://openalex.org/W6603727012","https://openalex.org/W6628810906"],"related_works":["https://openalex.org/W2015101254","https://openalex.org/W1972318883","https://openalex.org/W2105454578","https://openalex.org/W1848770611","https://openalex.org/W2121305283","https://openalex.org/W2534582423","https://openalex.org/W2134727924","https://openalex.org/W2096820446","https://openalex.org/W2114921205","https://openalex.org/W2140393911"],"abstract_inverted_index":{"It":[0],"has":[1,90],"been":[2,69,91],"suggested":[3],"that":[4,26,43,93,106],"\u00bfnear-codewords\u00bf":[5],"may":[6],"be":[7,37,72,144],"a":[8,24,50,123],"significant":[9],"factor":[10],"affecting":[11],"decoding":[12],"failures":[13],"of":[14,30,49,60,74,96,135],"LDPC":[15,62,65,81,97,139],"codes":[16,67,83,99,156],"over":[17],"the":[18,31,46,57,76,104,107,127,149],"AWGN":[19],"channel.":[20],"A":[21],"near-codeword":[22],"is":[23],"sequence":[25],"satisfies":[27],"almost":[28],"all":[29],"check":[32],"equations.":[33],"These":[34],"near-codewords":[35],"can":[36,143],"associated":[38],"with":[39,84,113],"so-called":[40],"`trapping":[41],"sets'":[42],"exist":[44],"in":[45,103],"Tanner":[47],"graph":[48],"code.":[51],"In":[52],"this":[53],"paper,":[54],"we":[55],"analyse":[56],"trapping":[58,128],"sets":[59],"protograph-based":[61,138],"convolutional":[63,66,98,140],"codes.":[64,141],"have":[68],"shown":[70,92],"to":[71,121,146],"capable":[73],"achieving":[75],"same":[77],"capacity-approaching":[78],"performance":[79],"as":[80],"block":[82],"iterative":[85,158],"message-passing":[86,159],"decoding.":[87,160],"Further,":[88],"it":[89],"some":[94],"ensembles":[95,134],"are":[100,119],"asymptotically":[101,136],"good,":[102],"sense":[105],"average":[108],"free":[109],"distance":[110],"grows":[111],"linearly":[112],"constraint":[114],"length.":[115],"Here,":[116],"asymptotic":[117],"methods":[118],"used":[120,145],"calculate":[122],"lower":[124],"bound":[125],"on":[126],"set":[129],"growth":[130],"rates":[131],"for":[132,154],"two":[133],"good":[137],"This":[142],"predict":[147],"where":[148],"error":[150],"floor":[151],"will":[152],"occur":[153],"these":[155],"under":[157]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}