{"id":"https://openalex.org/W2141709486","doi":"https://doi.org/10.1109/isit.2011.6033700","title":"Exact free distance and trapping set growth rates for LDPC convolutional codes","display_name":"Exact free distance and trapping set growth rates for LDPC convolutional codes","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2141709486","doi":"https://doi.org/10.1109/isit.2011.6033700","mag":"2141709486"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2011.6033700","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1106.1414","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":false,"raw_author_name":"David G. M. Mitchell","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","[Dept. of Electrical Engineering, University of Notre Dame, Indiana, 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 Electrical Engineering, University of Notre Dame, Indiana, 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":"Ali E. Pusane","raw_affiliation_strings":["Department of Electrical and Electronics Engineering, Bogazici University, Istanbul, Turkey","Department of Electrical and Electronics Engineering, Bo\u011fazi\u00e7i University, \u0130stanbul, Turkey#TAB#"],"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":"Department of Electrical and Electronics Engineering, Bo\u011fazi\u00e7i University, \u0130stanbul, Turkey#TAB#","institution_ids":["https://openalex.org/I4405392"]}]},{"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/I245417339","display_name":"Vodafone (Germany)","ror":"https://ror.org/044qwkx83","country_code":"DE","type":"company","lineage":["https://openalex.org/I245417339","https://openalex.org/I74316835"]},{"id":"https://openalex.org/I78650965","display_name":"Technische Universit\u00e4t Dresden","ror":"https://ror.org/042aqky30","country_code":"DE","type":"education","lineage":["https://openalex.org/I78650965"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Michael Lentmaier","raw_affiliation_strings":["Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany","Vodafone Chair Mobile Communications Systems Dresden University of Technology, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vodafone Chair Mobile Communications Systems, Dresden University of Technology, Dresden, Germany","institution_ids":["https://openalex.org/I245417339"]},{"raw_affiliation_string":"Vodafone Chair Mobile Communications Systems Dresden University of Technology, Germany","institution_ids":["https://openalex.org/I78650965"]}]},{"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":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","[Dept. of Electrical Engineering, University of Notre Dame, Indiana, 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 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":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"56","issue":null,"first_page":"1096","last_page":"1100"},"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.9969000220298767,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9918000102043152,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.751007080078125},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.6686708927154541},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6313064098358154},{"id":"https://openalex.org/keywords/trapping","display_name":"Trapping","score":0.5952715277671814},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.593165397644043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5499120950698853},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5325053930282593},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5104962587356567},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4838082194328308},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4515567719936371},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4179190695285797},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3123052716255188},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3038821220397949},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2253047227859497},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.0744762122631073},{"id":"https://openalex.org/keywords/biology","display_name":"Biology","score":0.06175360083580017},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.05399706959724426}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.751007080078125},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.6686708927154541},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6313064098358154},{"id":"https://openalex.org/C2777924906","wikidata":"https://www.wikidata.org/wiki/Q34168","display_name":"Trapping","level":2,"score":0.5952715277671814},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.593165397644043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5499120950698853},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5325053930282593},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5104962587356567},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4838082194328308},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4515567719936371},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4179190695285797},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3123052716255188},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3038821220397949},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2253047227859497},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0744762122631073},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.06175360083580017},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.05399706959724426},{"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2011.6033700","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2011.6033700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1106.1414","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1106.1414","pdf_url":"https://arxiv.org/pdf/1106.1414","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:lup.lub.lu.se:57386ea7-f709-4be3-8856-a34f52a09e2e","is_oa":true,"landing_page_url":"https://lup.lub.lu.se/record/3731146","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":"pp 1096-1100 (2011)","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1106.1414","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1106.1414","pdf_url":"https://arxiv.org/pdf/1106.1414","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"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":27,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1484692004","https://openalex.org/W1618499549","https://openalex.org/W1676391945","https://openalex.org/W1976430875","https://openalex.org/W1984762281","https://openalex.org/W1991528082","https://openalex.org/W2001732758","https://openalex.org/W2005457258","https://openalex.org/W2039544061","https://openalex.org/W2041324282","https://openalex.org/W2041603746","https://openalex.org/W2106958932","https://openalex.org/W2118552966","https://openalex.org/W2123119950","https://openalex.org/W2126275884","https://openalex.org/W2134247900","https://openalex.org/W2150368154","https://openalex.org/W2168300614","https://openalex.org/W2950370164","https://openalex.org/W3105422132","https://openalex.org/W3125530803","https://openalex.org/W4285719527","https://openalex.org/W6603727012","https://openalex.org/W6628810906","https://openalex.org/W6660644110","https://openalex.org/W7026758661"],"related_works":["https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2047069332","https://openalex.org/W2352157218","https://openalex.org/W2806845321","https://openalex.org/W4293418541","https://openalex.org/W2150454230","https://openalex.org/W3006690200","https://openalex.org/W1989997946","https://openalex.org/W2124763903"],"abstract_inverted_index":{"Ensembles":[0],"of":[1,36,51,53,98],"(J,K)-regular":[2],"low-density":[3],"parity-check":[4],"convolutional":[5],"(LDPCC)":[6],"codes":[7,39],"are":[8],"known":[9],"to":[10,40,62,86],"be":[11],"asymptotically":[12,106],"good,":[13,107],"in":[14],"the":[15,18,25,46,78,90,96,99],"sense":[16],"that":[17],"minimum":[19],"free":[20,47],"distance":[21,48],"grows":[22],"linearly":[23],"with":[24],"constraint":[26],"length.":[27],"In":[28],"this":[29],"paper,":[30],"we":[31],"use":[32],"a":[33,63,74],"protograph-based":[34],"analysis":[35],"terminated":[37],"LDPCC":[38,56,110],"obtain":[41,87],"an":[42],"upper":[43],"bound":[44,59,65],"on":[45,89],"growth":[49],"rate":[50],"ensembles":[52],"periodically":[54,108],"time-varying":[55,109],"codes.":[57],"This":[58,81],"is":[60,70,83],"compared":[61],"lower":[64],"and":[66],"evaluated":[67],"numerically.":[68],"It":[69],"found":[71],"that,":[72],"for":[73,104],"sufficiently":[75],"large":[76],"period,":[77],"bounds":[79,88],"coincide.":[80],"approach":[82],"then":[84],"extended":[85],"trapping":[91,102],"set":[92],"numbers,":[93],"which":[94],"define":[95],"size":[97],"smallest,":[100],"non-empty":[101],"sets,":[103],"these":[105],"code":[111],"ensembles.":[112]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2016-06-24T00:00:00"}