{"id":"https://openalex.org/W2158320432","doi":"https://doi.org/10.1109/allerton.2008.4797726","title":"On the minimum trapping distance of repeat accumulate accumulate codes","display_name":"On the minimum trapping distance of repeat accumulate accumulate codes","publication_year":2008,"publication_date":"2008-09-01","ids":{"openalex":"https://openalex.org/W2158320432","doi":"https://doi.org/10.1109/allerton.2008.4797726","mag":"2158320432"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2008.4797726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2008.4797726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","raw_type":"proceedings-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/A5021311010","display_name":"J\u00f6rg Kliewer","orcid":"https://orcid.org/0000-0003-0942-8006"},"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":"middle","author":{"id":"https://openalex.org/A5018210085","display_name":"Kamil Sh. Zigangirov","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":"Kamil S. Zigangirov","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":"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"],"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":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3814,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71859315,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1410","last_page":"1415"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6829195022583008},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.6410222053527832},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6194040775299072},{"id":"https://openalex.org/keywords/trapping","display_name":"Trapping","score":0.6062799096107483},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5665729641914368},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5204177498817444},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5136041641235352},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4845075309276581},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4820421636104584},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.45781391859054565},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.44785645604133606},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40745383501052856},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39871713519096375},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3979372978210449},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.39235684275627136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3767552375793457},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09628447890281677}],"concepts":[{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6829195022583008},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.6410222053527832},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6194040775299072},{"id":"https://openalex.org/C2777924906","wikidata":"https://www.wikidata.org/wiki/Q34168","display_name":"Trapping","level":2,"score":0.6062799096107483},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5665729641914368},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5204177498817444},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5136041641235352},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4845075309276581},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4820421636104584},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.45781391859054565},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.44785645604133606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40745383501052856},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39871713519096375},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3979372978210449},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.39235684275627136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3767552375793457},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09628447890281677},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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":2,"locations":[{"id":"doi:10.1109/allerton.2008.4797726","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2008.4797726","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.313.5075","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.313.5075","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jkl.nmsu.edu/~jkliewer/paper/KZC_Allerton08.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W147465018","https://openalex.org/W1484692004","https://openalex.org/W2001732758","https://openalex.org/W2028640165","https://openalex.org/W2095882513","https://openalex.org/W2117828856","https://openalex.org/W2125836614","https://openalex.org/W2128765501","https://openalex.org/W2145714519","https://openalex.org/W2148981492","https://openalex.org/W2150212378","https://openalex.org/W2153344955","https://openalex.org/W2564130517","https://openalex.org/W3216695808","https://openalex.org/W4285719527","https://openalex.org/W4300188436","https://openalex.org/W6605892194","https://openalex.org/W6628810906"],"related_works":["https://openalex.org/W2900120528","https://openalex.org/W2783895911","https://openalex.org/W2034401304","https://openalex.org/W2795193539","https://openalex.org/W4245458608","https://openalex.org/W2273978823","https://openalex.org/W2315999626","https://openalex.org/W2806663979","https://openalex.org/W2157771100","https://openalex.org/W2153501912"],"abstract_inverted_index":{"We":[0,35],"consider":[1],"the":[2,28,40,52,57,61,68,87],"ensemble":[3],"of":[4,11,39,60,99],"codes":[5],"formed":[6],"by":[7,75],"a":[8,12,37,47,77,82],"serial":[9],"concatenation":[10],"repetition":[13],"code":[14,97],"with":[15,93,104],"two":[16],"accumulators":[17],"through":[18],"uniform":[19],"random":[20],"interleavers.":[21],"For":[22],"this":[23],"ensemble,":[24],"asymptotic":[25],"expressions":[26],"for":[27,96],"normalized":[29],"minimum":[30,69,88],"trapping":[31,70,89],"distance":[32,71,90],"are":[33],"derived.":[34],"employ":[36],"variant":[38],"Gallager-Zyablov-Pinsker":[41],"bit":[42],"flipping":[43],"decoding":[44],"algorithm":[45],"on":[46,56],"binary":[48],"symmetric":[49],"channel,":[50],"where":[51],"analysis":[53],"is":[54],"based":[55],"factor":[58],"graph":[59],"code.":[62],"In":[63],"particular,":[64],"we":[65,84],"show":[66],"that":[67,86],"can":[72],"be":[73],"determined":[74],"solving":[76],"non-linear":[78],"optimization":[79],"problem.":[80],"As":[81],"result":[83],"find":[85],"grows":[91],"linearly":[92],"block":[94],"length":[95],"rates":[98],"1/3":[100],"and":[101],"smaller,":[102],"albeit":[103],"very":[105],"small":[106],"growth":[107],"rate":[108],"coefficients.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}