{"id":"https://openalex.org/W2100528898","doi":"https://doi.org/10.1109/itw.2006.1633808","title":"On the Design of S-type Permutors for Double Serially Concatenated Convolutional Codes","display_name":"On the Design of S-type Permutors for Double Serially Concatenated Convolutional Codes","publication_year":2006,"publication_date":"2006-05-25","ids":{"openalex":"https://openalex.org/W2100528898","doi":"https://doi.org/10.1109/itw.2006.1633808","mag":"2100528898"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2006.1633808","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2006.1633808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE Information Theory Workshop","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/A5027468353","display_name":"A. Huebner","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":true,"raw_author_name":"A. Huebner","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, IN 46556, USA, Email: huebner.7@nd.edu"],"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":"University of Notre Dame, Dept. of Electrical Engineering, Notre Dame, IN 46556, USA, Email: huebner.7@nd.edu","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":"D.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, Notre Dame, IN, USA"],"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, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5027468353"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.3761,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.6627106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"sac 16","issue":null,"first_page":"188","last_page":"192"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9983999729156494,"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"}},"topics":[{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9983999729156494,"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/T11130","display_name":"Coding theory and cryptography","score":0.9983000159263611,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9962000250816345,"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/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.7952754497528076},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.7490606904029846},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.6865488290786743},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5925551652908325},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.55077064037323},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5148095488548279},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.373277485370636},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34410351514816284},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.328685998916626}],"concepts":[{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.7952754497528076},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7490606904029846},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.6865488290786743},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5925551652908325},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.55077064037323},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5148095488548279},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.373277485370636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34410351514816284},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.328685998916626}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2006.1633808","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2006.1633808","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE Information Theory Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W101564851","https://openalex.org/W1493541001","https://openalex.org/W1712593354","https://openalex.org/W2028640165","https://openalex.org/W2032208744","https://openalex.org/W2101503502","https://openalex.org/W2136831313","https://openalex.org/W2139745099","https://openalex.org/W2140163692","https://openalex.org/W2144893103","https://openalex.org/W2145714519","https://openalex.org/W2562965985","https://openalex.org/W4242536966","https://openalex.org/W4251263169","https://openalex.org/W4285719527","https://openalex.org/W6604195864","https://openalex.org/W6629343882"],"related_works":["https://openalex.org/W2015101254","https://openalex.org/W1944343091","https://openalex.org/W2168862745","https://openalex.org/W1603044377","https://openalex.org/W1580452828","https://openalex.org/W2128050244","https://openalex.org/W2130515157","https://openalex.org/W1996737726","https://openalex.org/W2209506458","https://openalex.org/W2160335134"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"the":[3,16,31,39,48,56,60,67,70],"impact":[4],"of":[5,19,30,41,59,69,73],"S-type":[6],"permutors,":[7],"i.e.,":[8],"permutors":[9],"that":[10,55],"provide":[11],"a":[12,42],"non-trivial":[13],"separation,":[14],"on":[15,38],"minimum":[17,57],"distance":[18,58],"double":[20],"serially":[21,86],"concatenated":[22,87],"convolutional":[23],"codes":[24,92],"is":[25,36,63],"considered.":[26],"A":[27],"joint":[28],"design":[29,53],"outer":[32],"and":[33,82,88],"inner":[34],"permutor":[35,45],"presented":[37,81],"basis":[40],"newly":[43],"introduced":[44],"parameter":[46],"-":[47],"so-called":[49],"symbol":[50],"span.":[51],"This":[52],"guarantees":[54],"overall":[61],"code":[62],"lower":[64],"bounded":[65],"by":[66],"product":[68],"free":[71],"distances":[72],"all":[74],"three":[75],"component":[76],"codes.":[77],"Simulation":[78],"results":[79],"are":[80,93],"comparisons":[83],"with":[84],"single":[85],"double/generalized":[89],"repeat":[90],"accumulate":[91],"briefly":[94],"sketched.":[95]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}