{"id":"https://openalex.org/W2004646282","doi":"https://doi.org/10.1109/tcom.1974.1092169","title":"Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes","display_name":"Real-Time Minimal-Bit-Error Probability Decoding of Convolutional Codes","publication_year":1974,"publication_date":"1974-02-01","ids":{"openalex":"https://openalex.org/W2004646282","doi":"https://doi.org/10.1109/tcom.1974.1092169","mag":"2004646282"},"language":"en","primary_location":{"id":"doi:10.1109/tcom.1974.1092169","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcom.1974.1092169","pdf_url":null,"source":{"id":"https://openalex.org/S4210170832","display_name":"IRE Transactions on Communications Systems","issn_l":"0096-2244","issn":["0096-2244","2162-2132"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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 Communications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ntrs.nasa.gov/api/citations/19740018588/downloads/19740018588.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004053295","display_name":"L. Lee","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":"L. Lee","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN, USA","University of Notre Dame, Notre Dame, Ind., 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":"University of Notre Dame, Notre Dame, Ind., USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004053295"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":5.6816,"has_fulltext":true,"cited_by_count":48,"citation_normalized_percentile":{"value":0.95276417,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"22","issue":"2","first_page":"146","last_page":"151"},"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998000264167786,"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9997000098228455,"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/sequential-decoding","display_name":"Sequential decoding","score":0.8811526894569397},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.816564679145813},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7851868271827698},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.7665053606033325},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.7436326146125793},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7435431480407715},{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.7420584559440613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6687313318252563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6612186431884766},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5621663928031921},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.48158764839172363},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.41245734691619873},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.4090580344200134},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3567339777946472},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2108001410961151}],"concepts":[{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.8811526894569397},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.816564679145813},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7851868271827698},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.7665053606033325},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.7436326146125793},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7435431480407715},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.7420584559440613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6687313318252563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6612186431884766},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5621663928031921},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.48158764839172363},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.41245734691619873},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.4090580344200134},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3567339777946472},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2108001410961151}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tcom.1974.1092169","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcom.1974.1092169","pdf_url":null,"source":{"id":"https://openalex.org/S4210170832","display_name":"IRE Transactions on Communications Systems","issn_l":"0096-2244","issn":["0096-2244","2162-2132"],"is_oa":false,"is_in_doaj":false,"is_core":false,"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 Communications","raw_type":"journal-article"},{"id":"pmh:oai:casi.ntrs.nasa.gov:19740018588","is_oa":true,"landing_page_url":"http://hdl.handle.net/2060/19740018588","pdf_url":"https://ntrs.nasa.gov/api/citations/19740018588/downloads/19740018588.pdf","source":{"id":"https://openalex.org/S4377196257","display_name":"NASA STI Repository (National Aeronautics and Space Administration)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210124779","host_organization_name":"National Aeronautics and Space Administration","host_organization_lineage":["https://openalex.org/I4210124779"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CASI","raw_type":"EE-7312"}],"best_oa_location":{"id":"pmh:oai:casi.ntrs.nasa.gov:19740018588","is_oa":true,"landing_page_url":"http://hdl.handle.net/2060/19740018588","pdf_url":"https://ntrs.nasa.gov/api/citations/19740018588/downloads/19740018588.pdf","source":{"id":"https://openalex.org/S4377196257","display_name":"NASA STI Repository (National Aeronautics and Space Administration)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210124779","host_organization_name":"National Aeronautics and Space Administration","host_organization_lineage":["https://openalex.org/I4210124779"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"CASI","raw_type":"EE-7312"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2004646282.pdf","grobid_xml":"https://content.openalex.org/works/W2004646282.grobid-xml"},"referenced_works_count":4,"referenced_works":["https://openalex.org/W1562979145","https://openalex.org/W1991133427","https://openalex.org/W2045407304","https://openalex.org/W2135004694"],"related_works":["https://openalex.org/W3096277017","https://openalex.org/W2544568790","https://openalex.org/W1915619113","https://openalex.org/W2790444905","https://openalex.org/W4232476001","https://openalex.org/W2143297499","https://openalex.org/W2146383045","https://openalex.org/W2375912048","https://openalex.org/W2025673760","https://openalex.org/W2783469447"],"abstract_inverted_index":{"A":[0,59],"recursive":[1],"procedure":[2],"is":[3,47,70,85],"derived":[4],"for":[5,26,75,106],"decoding":[6,24,36,45,57,63,95],"of":[7,21,66],"rate":[8],"<tex":[9],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[10],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">R":[11],"=":[12],"1/n</tex>":[13],"binary":[14],"convolutional":[15],"codes":[16],"which":[17],"minimizes":[18],"the":[19,22,32,35,55,67,78,88,102],"probability":[20],"individual":[23],"decisions":[25],"each":[27],"information":[28],"bit,":[29],"subject":[30],"to":[31,40,77],"constraint":[33],"that":[34,87],"delay":[37],"be":[38],"limited":[39],"\u0394":[41],"branches.":[42],"This":[43],"new":[44,79,89],"algorithm":[46,69,80,90],"similar":[48],"to,":[49],"but":[50],"somewhat":[51],"more":[52],"complex":[53],"than,":[54],"Viterbi":[56,68,94],"algorithm.":[58],"\"real-time,\"":[60],"i.e.,":[61],"fixed":[62],"delay,":[64],"version":[65],"also":[71],"developed":[72],"and":[73],"used":[74],"comparison":[76],"on":[81],"simulated":[82],"channels.":[83],"It":[84],"shown":[86],"offers":[91],"advantages":[92],"over":[93],"in":[96,101],"soft-decision":[97],"applications,":[98],"such":[99],"as":[100],"inner":[103],"coding":[104],"system":[105],"concatenated":[107],"coding.":[108]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}