{"id":"https://openalex.org/W2102222153","doi":"https://doi.org/10.1109/tit.2008.2006461","title":"On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes","display_name":"On Low-Complexity Maximum-Likelihood Decoding of Convolutional Codes","publication_year":2008,"publication_date":"2008-12-01","ids":{"openalex":"https://openalex.org/W2102222153","doi":"https://doi.org/10.1109/tit.2008.2006461","mag":"2102222153"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2008.2006461","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2006461","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0711.3077","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jie Luo","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jie Luo","raw_affiliation_strings":["The Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO, USA"],"affiliations":[{"raw_affiliation_string":"The Electrical and Computer Engineering Department, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.13653716,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"54","issue":"12","first_page":"5756","last_page":"5760"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.43149998784065247,"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.43149998784065247,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.34220001101493835,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.09749999642372131,"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/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.7732999920845032},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.707099974155426},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6664000153541565},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.6383000016212463},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6198999881744385},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.604200005531311},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5105000138282776},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.47510001063346863},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4668999910354614}],"concepts":[{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.7732999920845032},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.707099974155426},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6664000153541565},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6383000016212463},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6198999881744385},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6075999736785889},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.604200005531311},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5116999745368958},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5105000138282776},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.47510001063346863},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4668999910354614},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4465999901294708},{"id":"https://openalex.org/C163836022","wikidata":"https://www.wikidata.org/wiki/Q6771326","display_name":"Markov model","level":3,"score":0.44179999828338623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4343000054359436},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4007999897003174},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.39480000734329224},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3880000114440918},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C189973286","wikidata":"https://www.wikidata.org/wiki/Q176695","display_name":"Markov property","level":4,"score":0.3407000005245209},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.32109999656677246},{"id":"https://openalex.org/C196455857","wikidata":"https://www.wikidata.org/wiki/Q5473264","display_name":"Forward algorithm","level":5,"score":0.3043000102043152},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2985000014305115},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2985000014305115},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.296999990940094},{"id":"https://openalex.org/C54907487","wikidata":"https://www.wikidata.org/wiki/Q7915688","display_name":"Variable-order Markov model","level":4,"score":0.25540000200271606},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.2540000081062317},{"id":"https://openalex.org/C23224414","wikidata":"https://www.wikidata.org/wiki/Q176769","display_name":"Hidden Markov model","level":2,"score":0.25380000472068787}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2008.2006461","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2008.2006461","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0711.3077","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0711.3077","pdf_url":"https://arxiv.org/pdf/0711.3077","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0711.3077","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0711.3077","pdf_url":"https://arxiv.org/pdf/0711.3077","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":8,"referenced_works":["https://openalex.org/W1997002146","https://openalex.org/W2099462267","https://openalex.org/W2133676619","https://openalex.org/W2139866533","https://openalex.org/W2142384583","https://openalex.org/W2152227186","https://openalex.org/W2156787051","https://openalex.org/W4242536966"],"related_works":[],"abstract_inverted_index":{"This":[0],"letter":[1],"considers":[2],"the":[3,20,31,40,54,83,88,114,134],"average":[4],"complexity":[5,35,140],"of":[6,10,45,56,95,113,153],"maximum-likelihood":[7],"(ML)":[8],"decoding":[9,14],"convolutional":[11],"codes.":[12],"ML":[13,147],"can":[15,104,137],"be":[16,105],"modeled":[17],"as":[18,49],"finding":[19],"most":[21],"probable":[22],"path":[23,48,59,66],"taken":[24],"through":[25],"a":[26,46,50,96,100,151],"Markov":[27,47,58,156],"graph.":[28],"Integrated":[29],"with":[30],"Viterbi":[32],"algorithm":[33],"(VA),":[34],"reduction":[36],"methods":[37],"often":[38],"use":[39],"sum":[41],"log":[42,111,123],"likelihood":[43,124],"(SLL)":[44],"bound":[51],"to":[52,62,91,146],"disprove":[53],"optimality":[55,76,94,126],"other":[57],"sets":[60],"and":[61,86],"consequently":[63],"avoid":[64],"exhaustive":[65],"search.":[67],"In":[68],"this":[69],"letter,":[70],"it":[71],"is":[72,118],"shown":[73],"that":[74,120],"SLL-based":[75],"tests":[77],"are":[78,144],"inefficient":[79],"if":[80],"one":[81],"fixes":[82],"coding":[84],"memory":[85],"takes":[87],"codeword":[89,135],"length":[90],"infinity.":[92],"Alternatively,":[93],"source":[97],"symbol":[98],"at":[99],"given":[101],"time":[102],"index":[103],"testified":[106],"using":[107],"bounds":[108],"derived":[109],"from":[110],"likelihoods":[112],"neighboring":[115,122],"symbols.":[116],"It":[117],"demonstrated":[119],"such":[121],"(NLL)-based":[125],"tests,":[127],"whose":[128],"efficiency":[129],"does":[130],"not":[131],"depend":[132],"on":[133],"length,":[136],"bring":[138],"significant":[139],"reduction.":[141],"The":[142],"results":[143],"generalized":[145],"sequence":[148],"detection":[149],"in":[150],"class":[152],"discrete-time":[154],"hidden":[155],"systems.":[157]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}