{"id":"https://openalex.org/W1991133427","doi":"https://doi.org/10.1109/tit.1967.1054010","title":"Error bounds for convolutional codes and an asymptotically optimum decoding algorithm","display_name":"Error bounds for convolutional codes and an asymptotically optimum decoding algorithm","publication_year":1967,"publication_date":"1967-04-01","ids":{"openalex":"https://openalex.org/W1991133427","doi":"https://doi.org/10.1109/tit.1967.1054010","mag":"1991133427"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1967.1054010","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1967.1054010","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":["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/A5078975478","display_name":"Andrew J. Viterbi","orcid":"https://orcid.org/0000-0003-4671-9849"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"A. Viterbi","raw_affiliation_strings":["Department of Engineering, University of California, Los Angeles, CA, USA","[Department of Engineering, University of California, Los Angeles, CA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Engineering, University of California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]},{"raw_affiliation_string":"[Department of Engineering, University of California, Los Angeles, CA, USA]","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078975478"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":31.3701,"has_fulltext":false,"cited_by_count":6770,"citation_normalized_percentile":{"value":0.99895507,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"13","issue":"2","first_page":"260","last_page":"269"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9994000196456909,"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.9993000030517578,"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/decoding-methods","display_name":"Decoding methods","score":0.7680253982543945},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6725213527679443},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6694971323013306},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.6516891717910767},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6370550394058228},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.529667317867279},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5283841490745544},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5067148804664612},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44671958684921265},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4456588923931122},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4444621205329895},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4380054473876953},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4269610345363617},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42173394560813904},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.41758063435554504},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.39204901456832886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3605666756629944},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3442094326019287},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.20352798700332642}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7680253982543945},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6725213527679443},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6694971323013306},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.6516891717910767},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6370550394058228},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.529667317867279},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5283841490745544},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5067148804664612},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44671958684921265},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4456588923931122},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4444621205329895},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4380054473876953},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4269610345363617},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42173394560813904},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.41758063435554504},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.39204901456832886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3605666756629944},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3442094326019287},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.20352798700332642},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1967.1054010","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1967.1054010","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1527096151","https://openalex.org/W1527268325","https://openalex.org/W1976797517","https://openalex.org/W1993944611","https://openalex.org/W2005530146","https://openalex.org/W2034274945","https://openalex.org/W2087362480","https://openalex.org/W2264297261","https://openalex.org/W3190595840","https://openalex.org/W4238661777"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2134727924","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2443615171"],"abstract_inverted_index":{"The":[0,88],"probability":[1],"of":[2,24,28,53,59,64,75,78,121],"error":[3],"in":[4],"decoding":[5,98,123],"an":[6],"optimal":[7,65],"convolutional":[8,66],"code":[9],"transmitted":[10],"over":[11],"a":[12,22,57,94],"memoryless":[13],"channel":[14],"is":[15,68,91,101],"bounded":[16],"from":[17],"above":[18,44,109],"and":[19,113],"below":[20],"as":[21],"function":[23,58],"the":[25,29,36,49,62,79,82],"constraint":[26,60],"length":[27,61],"code.":[30],"For":[31],"all":[32],"but":[33],"pathological":[34],"channels":[35],"bounds":[37],"are":[38],"asymptotically":[39,105],"(exponentially)":[40],"tight":[41],"for":[42,93,107],"rates":[43,108],"<tex":[45,110],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[46,111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">R_{0}</tex>":[47,112],",":[48],"computational":[50],"cutoff":[51],"rate":[52],"sequential":[54,122],"decoding.":[55],"As":[56],"performance":[63,115],"codes":[67,77],"shown":[69,102],"to":[70,73,103,119],"be":[71,104],"superior":[72],"that":[74,120],"block":[76],"same":[80],"length,":[81],"relative":[83],"improvement":[84],"increasing":[85],"with":[86],"rate.":[87],"upper":[89],"bound":[90],"obtained":[92],"specific":[95],"probabilistic":[96],"nonsequential":[97],"algorithm":[99],"which":[100],"optimum":[106],"whose":[114],"bears":[116],"certain":[117],"similarities":[118],"algorithms.":[124]},"counts_by_year":[{"year":2026,"cited_by_count":58},{"year":2025,"cited_by_count":165},{"year":2024,"cited_by_count":164},{"year":2023,"cited_by_count":208},{"year":2022,"cited_by_count":222},{"year":2021,"cited_by_count":252},{"year":2020,"cited_by_count":291},{"year":2019,"cited_by_count":259},{"year":2018,"cited_by_count":283},{"year":2017,"cited_by_count":253},{"year":2016,"cited_by_count":234},{"year":2015,"cited_by_count":245},{"year":2014,"cited_by_count":304},{"year":2013,"cited_by_count":337},{"year":2012,"cited_by_count":272}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}