{"id":"https://openalex.org/W2041324282","doi":"https://doi.org/10.1109/tit.2012.2211995","title":"Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes","display_name":"Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes","publication_year":2012,"publication_date":"2012-08-07","ids":{"openalex":"https://openalex.org/W2041324282","doi":"https://doi.org/10.1109/tit.2012.2211995","mag":"2041324282"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2012.2211995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2211995","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-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/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":"D. G. M. Mitchell","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","[Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA]"],"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":"[Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA]","institution_ids":["https://openalex.org/I107639228"]}]},{"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":"A. E. Pusane","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Bogazici University, Istanbul, Turkey","Dept. of Electr. & Electron. Eng., Bogazici Univ., I\u0301stanbul, Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Electronics Engineering, Bogazici University, Istanbul, Turkey","institution_ids":["https://openalex.org/I4405392"]},{"raw_affiliation_string":"Dept. of Electr. & Electron. Eng., Bogazici Univ., I\u0301stanbul, Turkey","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":"D. J. Costello","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","[Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA]"],"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":"[Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA]","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.8981,"has_fulltext":false,"cited_by_count":62,"citation_normalized_percentile":{"value":0.97092354,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"59","issue":"1","first_page":"254","last_page":"281"},"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.9988999962806702,"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.9954000115394592,"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.8665381669998169},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.7366060614585876},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6565494537353516},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6491807699203491},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.6324878931045532},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5558183193206787},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4875902533531189},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4862348139286041},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.482757031917572},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.47184160351753235},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4202268719673157},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3577316403388977}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8665381669998169},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7366060614585876},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6565494537353516},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6491807699203491},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.6324878931045532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5558183193206787},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4875902533531189},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4862348139286041},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.482757031917572},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.47184160351753235},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4202268719673157},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3577316403388977}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2012.2211995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2012.2211995","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W91277888","https://openalex.org/W1484692004","https://openalex.org/W1511760703","https://openalex.org/W1604647333","https://openalex.org/W1793808004","https://openalex.org/W1967290776","https://openalex.org/W1976430875","https://openalex.org/W1982045017","https://openalex.org/W1984762281","https://openalex.org/W1991528082","https://openalex.org/W2001732758","https://openalex.org/W2005457258","https://openalex.org/W2011891413","https://openalex.org/W2014944833","https://openalex.org/W2039544061","https://openalex.org/W2041603746","https://openalex.org/W2071878365","https://openalex.org/W2073081764","https://openalex.org/W2085903266","https://openalex.org/W2095720433","https://openalex.org/W2095882513","https://openalex.org/W2098251978","https://openalex.org/W2106958932","https://openalex.org/W2110148463","https://openalex.org/W2115104320","https://openalex.org/W2115116691","https://openalex.org/W2118552966","https://openalex.org/W2123119950","https://openalex.org/W2125836614","https://openalex.org/W2126259959","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2136923821","https://openalex.org/W2137205555","https://openalex.org/W2137699000","https://openalex.org/W2140655888","https://openalex.org/W2142415334","https://openalex.org/W2148869952","https://openalex.org/W2150368154","https://openalex.org/W2151356723","https://openalex.org/W2152474312","https://openalex.org/W2153344955","https://openalex.org/W2154663979","https://openalex.org/W2162312124","https://openalex.org/W2168300614","https://openalex.org/W2170992065","https://openalex.org/W2172679141","https://openalex.org/W3125530803","https://openalex.org/W4242536966","https://openalex.org/W4285719527","https://openalex.org/W4300188436","https://openalex.org/W6628810906","https://openalex.org/W6630670498","https://openalex.org/W6674892158"],"related_works":["https://openalex.org/W2105454578","https://openalex.org/W2134727924","https://openalex.org/W2058859887","https://openalex.org/W2096820446","https://openalex.org/W2114921205","https://openalex.org/W2131398507","https://openalex.org/W99853930","https://openalex.org/W2110220059","https://openalex.org/W1504657239","https://openalex.org/W2010879611"],"abstract_inverted_index":{"Low-density":[0],"parity-check":[1],"(LDPC)":[2],"convolutional":[3,51,95,201],"codes":[4,52,58,121,171,202],"have":[5,59],"been":[6,156],"shown":[7,157],"to":[8,29,37,70,88,102],"be":[9],"capable":[10],"of":[11,23,46,92,106,150,169,187,195,223],"achieving":[12],"capacity-approaching":[13],"performance":[14,149],"with":[15,68,179,231],"iterative":[16,180],"message-passing":[17,181],"decoding.":[18,135,182],"In":[19,80,183],"the":[20,34,60,63,71,75,85,93,99,107,124,148,173,184,192,196,207,221,224,232],"first":[21],"part":[22,186,211],"this":[24,188],"paper,":[25,189],"using":[26,214],"asymptotic":[27],"methods":[28,139],"obtain":[30],"lower":[31],"bounds":[32],"on":[33],"free":[35,64,86,115],"distance":[36,65,87,101,116],"constraint":[38,72,89,233],"length":[39,90,104,234],"ratio,":[40],"we":[41,82,190,218],"show":[42,83,219],"that":[43,62,84,120,146,158,220],"several":[44],"ensembles":[45,76,97],"regular":[47],"and":[48,213],"irregular":[49],"LDPC":[50,56,94,109,170,200],"derived":[53],"from":[54,123],"protograph-based":[55,199],"block":[57,103,110],"property":[61],"grows":[66,229],"linearly":[67,230],"respect":[69],"length,":[73],"i.e.,":[74],"are":[77,140,143,162],"asymptotically":[78,197],"good.":[79],"particular,":[81],"ratio":[91,105],"code":[96,111],"exceeds":[98],"minimum":[100],"corresponding":[108],"ensembles.":[112,237],"A":[113],"large":[114],"growth":[117],"rate":[118],"indicates":[119],"drawn":[122],"ensemble":[125],"should":[126],"perform":[127],"well":[128],"at":[129],"high":[130],"signal-to-noise":[131],"ratios":[132],"under":[133],"maximum-likelihood":[134],"When":[136],"suboptimal":[137],"decoding":[138,167],"employed,":[141],"there":[142],"many":[144],"factors":[145],"affect":[147],"a":[151,163],"code.":[152],"Recently,":[153],"it":[154],"has":[155],"so-called":[159],"trapping":[160,193,227],"sets":[161,194],"significant":[164],"factor":[165],"affecting":[166],"failures":[168],"over":[172],"additive":[174],"white":[175],"Gaussian":[176],"noise":[177],"channel":[178],"second":[185],"study":[191],"good":[198],"considered":[203],"earlier.":[204],"By":[205],"extending":[206],"theory":[208],"presented":[209],"in":[210],"one":[212],"similar":[215],"bounding":[216],"techniques,":[217],"size":[222],"smallest":[225],"non-empty":[226],"set":[228],"for":[235],"these":[236]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}