{"id":"https://openalex.org/W2151814693","doi":"https://doi.org/10.1109/tit.1969.1054239","title":"On the Viterbi decoding algorithm","display_name":"On the Viterbi decoding algorithm","publication_year":1969,"publication_date":"1969-01-01","ids":{"openalex":"https://openalex.org/W2151814693","doi":"https://doi.org/10.1109/tit.1969.1054239","mag":"2151814693"},"language":"en","primary_location":{"id":"doi:10.1109/tit.1969.1054239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054239","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/A5069419916","display_name":"J. K. Omura","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J. Omura","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069419916"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.4889,"has_fulltext":false,"cited_by_count":225,"citation_normalized_percentile":{"value":0.99399485,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"15","issue":"1","first_page":"177","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10040","display_name":"Adaptive Control of Nonlinear Systems","score":0.9106000065803528,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10040","display_name":"Adaptive Control of Nonlinear Systems","score":0.9106000065803528,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.8516289591789246},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.8215709328651428},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.8106584548950195},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7845093011856079},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7138252854347229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6955137848854065},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.6408309936523438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6226040720939636},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5389955639839172},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.535060465335846},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4107087254524231},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.13952353596687317},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.09336134791374207}],"concepts":[{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.8516289591789246},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.8215709328651428},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.8106584548950195},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7845093011856079},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7138252854347229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6955137848854065},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.6408309936523438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6226040720939636},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5389955639839172},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.535060465335846},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4107087254524231},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.13952353596687317},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.09336134791374207}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.1969.1054239","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.1969.1054239","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W1991133427"],"related_works":["https://openalex.org/W1915619113","https://openalex.org/W2544568790","https://openalex.org/W3194244515","https://openalex.org/W2921374214","https://openalex.org/W2361773811","https://openalex.org/W171822854","https://openalex.org/W1546736863","https://openalex.org/W123028466","https://openalex.org/W176266968","https://openalex.org/W2165098971"],"abstract_inverted_index":{"A":[0],"new":[1],"interpretation":[2,20],"of":[3],"the":[4,10,21],"Viterbi":[5],"decoding":[6],"algorithm":[7],"based":[8],"on":[9],"state-space":[11],"approach":[12],"to":[13],"dyamical":[14],"systems":[15],"is":[16],"presented.":[17],"In":[18],"this":[19],"optimum":[22],"decoder":[23],"solves":[24],"a":[25],"generalized":[26],"regulator":[27],"control":[28],"problem":[29],"by":[30],"dynamic":[31],"programming":[32],"techniques.":[33]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}