{"id":"https://openalex.org/W2171574043","doi":"https://doi.org/10.1109/isit.2009.5205355","title":"Trapping set enumerators for repeat multiple accumulate code ensembles","display_name":"Trapping set enumerators for repeat multiple accumulate code ensembles","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2171574043","doi":"https://doi.org/10.1109/isit.2009.5205355","mag":"2171574043"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205355","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205355","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":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0905.3733","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Christian Koller","orcid":null},"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":"Christian Koller","raw_affiliation_strings":["Department of Electrical Engineering, University 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"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Alexandre Graell i Amat","orcid":null},"institutions":[{"id":"https://openalex.org/I205703379","display_name":"Institut Mines-T\u00e9l\u00e9com","ror":"https://ror.org/025vp2923","country_code":"FR","type":"facility","lineage":["https://openalex.org/I205703379"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Alexandre Graell i Amat","raw_affiliation_strings":["Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France","institution_ids":["https://openalex.org/I205703379"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jorg Kliewer","orcid":null},"institutions":[{"id":"https://openalex.org/I10052268","display_name":"New Mexico State University","ror":"https://ror.org/00hpz7z43","country_code":"US","type":"education","lineage":["https://openalex.org/I10052268"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jorg Kliewer","raw_affiliation_strings":["Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las Cruces, NM, USA","institution_ids":["https://openalex.org/I10052268"]}]},{"author_position":"last","author":{"id":null,"display_name":"Daniel J. Costello","orcid":null},"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"],"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"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0887,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81771969,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1819","last_page":"1823"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T11130","display_name":"Coding theory and cryptography","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/decoding-methods","display_name":"Decoding methods","score":0.5674999952316284},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5629000067710876},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.5299000144004822},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.508899986743927},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4787999987602234},{"id":"https://openalex.org/keywords/trellis","display_name":"Trellis (graph)","score":0.4700999855995178},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.44269999861717224},{"id":"https://openalex.org/keywords/repetition-code","display_name":"Repetition code","score":0.4239000082015991},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42329999804496765}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5906999707221985},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5674999952316284},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5629000067710876},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5361999869346619},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.5299000144004822},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.508899986743927},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4787999987602234},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.4700999855995178},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.44269999861717224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.426800012588501},{"id":"https://openalex.org/C194405637","wikidata":"https://www.wikidata.org/wiki/Q369367","display_name":"Repetition code","level":5,"score":0.4239000082015991},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42329999804496765},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4203999936580658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3853999972343445},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.36039999127388},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34700000286102295},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.34540000557899475},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.33000001311302185},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.3125},{"id":"https://openalex.org/C2777924906","wikidata":"https://www.wikidata.org/wiki/Q34168","display_name":"Trapping","level":2,"score":0.30309998989105225},{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.30149999260902405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29980000853538513},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.27970001101493835},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.271699994802475},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.27090001106262207},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.26930001378059387},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.25619998574256897},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.25450000166893005}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2009.5205355","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205355","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"},{"id":"pmh:oai:arXiv.org:0905.3733","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0905.3733","pdf_url":"https://arxiv.org/pdf/0905.3733","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:HAL:hal-00449556v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00449556","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT'09 : IEEE International Symposium on Information Theory, Jun 2009, S\u00e9oul, South Korea. pp.1819-1823, ⟨10.1109/ISIT.2009.5205355⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0905.3733","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0905.3733","pdf_url":"https://arxiv.org/pdf/0905.3733","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":5,"referenced_works":["https://openalex.org/W2001732758","https://openalex.org/W2137813581","https://openalex.org/W2145714519","https://openalex.org/W2153344955","https://openalex.org/W4300188436"],"related_works":[],"abstract_inverted_index":{"The":[0],"serial":[1],"concatenation":[2],"of":[3,15,62,72,104],"a":[4,16,45,85,101],"repetition":[5],"code":[6],"with":[7,33],"two":[8],"or":[9],"more":[10],"accumulators":[11],"has":[12,65],"the":[13,21,60,70,110,114],"advantage":[14],"simple":[17],"encoder":[18],"structure.":[19],"Furthermore,":[20],"resulting":[22],"ensemble":[23,90],"is":[24],"asymptotically":[25],"good":[26],"and":[27,49,120],"exhibits":[28],"minimum":[29],"distance":[30],"growing":[31],"linearly":[32],"block":[34,115],"length.":[35],"However,":[36],"in":[37],"practice":[38],"these":[39,73],"codes":[40,74,98],"cannot":[41],"be":[42,54],"decoded":[43],"by":[44,99],"maximum":[46],"likelihood":[47],"decoder,":[48],"iterative":[50,76],"decoding":[51],"schemes":[52],"must":[53],"employed.":[55],"For":[56],"low-density":[57],"parity-check":[58],"codes,":[59],"notion":[61],"trapping":[63,91,105],"sets":[64],"been":[66],"introduced":[67],"to":[68,118],"estimate":[69],"performance":[71],"under":[75],"message":[77],"passing":[78],"decoding.":[79],"In":[80],"this":[81],"paper,":[82],"we":[83],"present":[84],"closed":[86],"form":[87],"finite":[88],"length":[89,116],"set":[92],"enumerator":[93],"for":[94],"repeat":[95],"multiple":[96],"accumulate":[97],"creating":[100],"trellis":[102],"representation":[103],"sets.":[106],"We":[107],"also":[108],"obtain":[109],"asymptotic":[111],"expressions":[112],"when":[113],"tends":[117],"infinity":[119],"evaluate":[121],"them":[122],"numerically.":[123]},"counts_by_year":[{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}