{"id":"https://openalex.org/W2129220463","doi":"https://doi.org/10.1109/isit.2008.4595316","title":"Minimum distance bounds for multiple-serially concatenated code ensembles","display_name":"Minimum distance bounds for multiple-serially concatenated code ensembles","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2129220463","doi":"https://doi.org/10.1109/isit.2008.4595316","mag":"2129220463"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4595316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595316","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","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/A5059543924","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","Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN#TAB#"],"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#TAB#","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","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","Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las cruces, 88003, 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"]},{"raw_affiliation_string":"Klipsch School of Electrical and Computer Engineering, New Mexico State University, Las cruces, 88003, 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","Dept. of Electrical Engineering, University of Notre Dame, IN 46556 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, IN 46556 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","Dept. of Electrical Engineering, University of Notre Dame, IN 46556 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, IN 46556 USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9069,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87957899,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1888","last_page":"1892"},"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991000294685364,"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.9986000061035156,"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/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.7078233957290649},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5933674573898315},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5677580237388611},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.5609451532363892},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47950631380081177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47480928897857666},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.43062007427215576},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42337700724601746},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3511248528957367},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.2699720859527588},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.25841009616851807}],"concepts":[{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.7078233957290649},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5933674573898315},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5677580237388611},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.5609451532363892},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47950631380081177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47480928897857666},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.43062007427215576},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42337700724601746},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3511248528957367},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2699720859527588},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.25841009616851807},{"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2008.4595316","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595316","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.334.6829","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.334.6829","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/KKZC_ISIT08.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":13,"referenced_works":["https://openalex.org/W147465018","https://openalex.org/W2028640165","https://openalex.org/W2099111195","https://openalex.org/W2117828856","https://openalex.org/W2121606987","https://openalex.org/W2128372030","https://openalex.org/W2144893103","https://openalex.org/W2145714519","https://openalex.org/W2150212378","https://openalex.org/W2564130517","https://openalex.org/W2987657883","https://openalex.org/W3216695808","https://openalex.org/W6605892194"],"related_works":["https://openalex.org/W2534582423","https://openalex.org/W2121305283","https://openalex.org/W2904572964","https://openalex.org/W2168881646","https://openalex.org/W1972318883","https://openalex.org/W2514289626","https://openalex.org/W792671342","https://openalex.org/W2075640816","https://openalex.org/W2114921205","https://openalex.org/W1580452828"],"abstract_inverted_index":{"It":[0],"has":[1],"recently":[2],"been":[3],"shown":[4],"that":[5,95],"the":[6,10,31,43,48,69,73,79],"minimum":[7,74,102],"distance":[8,32,103],"of":[9,12,36,47,55,72,82,110],"ensemble":[11],"repeat":[13,88,96],"multiple":[14,89,97],"accumulate":[15,90,98],"codes":[16,99],"grows":[17],"linearly":[18],"with":[19,85],"block":[20],"length.":[21],"In":[22],"this":[23,83],"paper,":[24],"we":[25,93],"present":[26],"a":[27],"method":[28],"to":[29],"obtain":[30],"growth":[33,44,70,104],"rate":[34,45,49,71,86],"coefficient":[35,46],"multiple-serially":[37],"concatenated":[38,52],"code":[39,53,61,84],"ensembles":[40],"and":[41,92],"determine":[42],"1/2":[50,87],"double-serially":[51],"consisting":[54],"an":[56],"outer":[57],"memory":[58],"one":[59],"convolutional":[60],"followed":[62],"by":[63],"two":[64],"accumulators.":[65],"We":[66],"compare":[67],"both":[68],"distance,":[75],"as":[76,78],"well":[77],"convergence":[80],"behavior,":[81],"codes,":[91],"show":[94],"have":[100],"better":[101],"but":[105],"worse":[106],"performance":[107],"in":[108],"terms":[109],"convergence.":[111]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}