{"id":"https://openalex.org/W1905804357","doi":"https://doi.org/10.1109/itw.2006.1633830","title":"On the Behavior of the Distance Spectrum of Convolutional Codes under a Minimal Trellis Complexity Measure","display_name":"On the Behavior of the Distance Spectrum of Convolutional Codes under a Minimal Trellis Complexity Measure","publication_year":2006,"publication_date":"2006-05-25","ids":{"openalex":"https://openalex.org/W1905804357","doi":"https://doi.org/10.1109/itw.2006.1633830","mag":"1905804357"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2006.1633830","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2006.1633830","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/A5038639102","display_name":"Bartolomeu F. Uch\u00f4a-Filho","orcid":"https://orcid.org/0000-0003-3727-3988"},"institutions":[{"id":"https://openalex.org/I4104125","display_name":"Universidade Federal de Santa Catarina","ror":"https://ror.org/041akq887","country_code":"BR","type":"education","lineage":["https://openalex.org/I4104125"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"B.F. Uchoa-Filho","raw_affiliation_strings":["GPqCom/EEL/CTC/UFSC, Florianopolis, Santa Catarina, Brazil","GPqCom - EEL - CTC - UFSC, Florian\u00f3polis, SC - BRAZIL, uchoa@eel.ufsc.br"],"affiliations":[{"raw_affiliation_string":"GPqCom/EEL/CTC/UFSC, Florianopolis, Santa Catarina, Brazil","institution_ids":["https://openalex.org/I4104125"]},{"raw_affiliation_string":"GPqCom - EEL - CTC - UFSC, Florian\u00f3polis, SC - BRAZIL, uchoa@eel.ufsc.br","institution_ids":["https://openalex.org/I4104125"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067391848","display_name":"Richard Demo Souza","orcid":"https://orcid.org/0000-0002-7389-6245"},"institutions":[{"id":"https://openalex.org/I1283613182","display_name":"Universidade Tecnol\u00f3gica Federal do Paran\u00e1","ror":"https://ror.org/002v2kq79","country_code":"BR","type":"education","lineage":["https://openalex.org/I1283613182"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"R.D. Souza","raw_affiliation_strings":["DAELN-CPGEI-UTFPR, Curitiba, Parana, Brazil","Federal University of Technology - Parana"],"affiliations":[{"raw_affiliation_string":"DAELN-CPGEI-UTFPR, Curitiba, Parana, Brazil","institution_ids":["https://openalex.org/I1283613182"]},{"raw_affiliation_string":"Federal University of Technology - Parana","institution_ids":["https://openalex.org/I1283613182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044717316","display_name":"Cec\u00edlio Pimentel","orcid":"https://orcid.org/0000-0003-2632-919X"},"institutions":[{"id":"https://openalex.org/I4210138879","display_name":"Hospital das Cl\u00ednicas da Universidade Federal de Pernambuco","ror":"https://ror.org/03rehvw54","country_code":"BR","type":"healthcare","lineage":["https://openalex.org/I4210138879"]},{"id":"https://openalex.org/I25112270","display_name":"Universidade Federal de Pernambuco","ror":"https://ror.org/047908t24","country_code":"BR","type":"education","lineage":["https://openalex.org/I25112270"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"C. Pimentel","raw_affiliation_strings":["CODEC-DES-UFPE, Recife, Pernambuco, Brazil","Federal University of Pernambuco"],"affiliations":[{"raw_affiliation_string":"CODEC-DES-UFPE, Recife, Pernambuco, Brazil","institution_ids":["https://openalex.org/I4210138879"]},{"raw_affiliation_string":"Federal University of Pernambuco","institution_ids":["https://openalex.org/I25112270"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038639102"],"corresponding_institution_ids":["https://openalex.org/I4104125"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0689743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"283","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","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"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9909999966621399,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9904000163078308,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.8810293674468994},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6613886952400208},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6474443674087524},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.6468454599380493},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6319370865821838},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5343007445335388},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5225462317466736},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4708805978298187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4523431360721588},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4515577256679535},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4409337639808655},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42526698112487793},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3919367492198944}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.8810293674468994},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6613886952400208},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6474443674087524},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.6468454599380493},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6319370865821838},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5343007445335388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5225462317466736},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4708805978298187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4523431360721588},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4515577256679535},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4409337639808655},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42526698112487793},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3919367492198944}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2006.1633830","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2006.1633830","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":16,"referenced_works":["https://openalex.org/W1534925464","https://openalex.org/W1975641007","https://openalex.org/W1989118659","https://openalex.org/W1991162105","https://openalex.org/W2029017687","https://openalex.org/W2046612645","https://openalex.org/W2100350887","https://openalex.org/W2101114090","https://openalex.org/W2133352625","https://openalex.org/W2141514624","https://openalex.org/W2149902106","https://openalex.org/W2156938407","https://openalex.org/W2185844688","https://openalex.org/W2206295654","https://openalex.org/W4238661777","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2105454578","https://openalex.org/W1848770611","https://openalex.org/W2123798617","https://openalex.org/W2146655154","https://openalex.org/W1591476182","https://openalex.org/W1593765610","https://openalex.org/W2134727924","https://openalex.org/W1505411204","https://openalex.org/W190540493","https://openalex.org/W2566690554"],"abstract_inverted_index":{"In":[0],"this":[1,143],"paper,":[2],"we":[3],"investigate":[4],"the":[5,8,15,21,31,36,45,69,79,84,88,97,106,113,116,131,147],"behavior":[6],"of":[7,11,24,49,112],"distance":[9,94,123,133,155],"spectrum":[10,95,134,156],"convolutional":[12,52,74,101,110],"codes":[13,61,75,90,111,118],"when":[14],"decoding":[16,81,127,140,144,151],"complexity":[17,82,145,152],"is":[18,55,135],"measured":[19],"by":[20],"total":[22],"number":[23],"edge":[25],"symbols":[26],"per":[27],"information":[28],"bit":[29],"in":[30],"minimal":[32],"trellis":[33],"module":[34],"representing":[35],"code.":[37],"We":[38],"conduct":[39],"a":[40,125],"code":[41,70,86],"search":[42],"restricted":[43],"to":[44,58,105],"recently":[46],"introduced":[47],"class":[48],"generalized":[50],"punctured":[51,100],"codes,":[53],"which":[54],"broad":[56],"enough":[57],"contain":[59],"good":[60,73],"and":[62,83],"yet":[63],"has":[64],"structural":[65],"properties":[66],"that":[67,149],"facilitate":[68],"search.":[71],"New":[72],"are":[76],"tabulated.":[77],"For":[78],"same":[80,85,114,132],"rate,":[87,115],"new":[89,117],"have":[91,120],"slightly":[92],"better":[93,154],"than":[96],"best":[98,107],"known":[99,108],"codes.":[102],"When":[103],"compared":[104],"unit-memory":[109],"typically":[119],"improved":[121],"free":[122],"for":[124],"given":[126],"complexity,":[128],"or":[129],"about":[130],"achieved":[136],"with":[137],"much":[138],"lower":[139],"complexity.":[141],"Under":[142],"measure,":[146],"behaviour":[148],"higher":[150],"implies":[153],"remains":[157],"valid.":[158]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
