{"id":"https://openalex.org/W3126138755","doi":"https://doi.org/10.1109/globecom42002.2020.9322505","title":"Optimal CRC Design and Serial List Viterbi Decoding for Multi-Input Convolutional Codes","display_name":"Optimal CRC Design and Serial List Viterbi Decoding for Multi-Input Convolutional Codes","publication_year":2020,"publication_date":"2020-12-01","ids":{"openalex":"https://openalex.org/W3126138755","doi":"https://doi.org/10.1109/globecom42002.2020.9322505","mag":"3126138755"},"language":"en","primary_location":{"id":"doi:10.1109/globecom42002.2020.9322505","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom42002.2020.9322505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","raw_type":"proceedings-article"},"type":"conference-paper","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/A5076014543","display_name":"Mohammad Karimzadeh","orcid":"https://orcid.org/0000-0002-7329-7293"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Karimzadeh","raw_affiliation_strings":["Tufts University, Medford, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000020663","display_name":"Mai Vu","orcid":"https://orcid.org/0000-0003-4486-5500"},"institutions":[{"id":"https://openalex.org/I121934306","display_name":"Tufts University","ror":"https://ror.org/05wvpxv85","country_code":"US","type":"education","lineage":["https://openalex.org/I121934306"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mai Vu","raw_affiliation_strings":["Tufts University, Medford, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tufts University, Medford, MA, USA","institution_ids":["https://openalex.org/I121934306"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I121934306"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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.9984999895095825,"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.8864203691482544},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.8399324417114258},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.7955796718597412},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7671252489089966},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.7017378211021423},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6843318343162537},{"id":"https://openalex.org/keywords/soft-output-viterbi-algorithm","display_name":"Soft output Viterbi algorithm","score":0.550406277179718},{"id":"https://openalex.org/keywords/iterative-viterbi-decoding","display_name":"Iterative Viterbi decoding","score":0.549126386642456},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5407519340515137},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3597407937049866},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.335620641708374},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.30724698305130005},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.13624343276023865}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.8864203691482544},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.8399324417114258},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.7955796718597412},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7671252489089966},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.7017378211021423},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6843318343162537},{"id":"https://openalex.org/C130319729","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Soft output Viterbi algorithm","level":5,"score":0.550406277179718},{"id":"https://openalex.org/C113638808","wikidata":"https://www.wikidata.org/wiki/Q6094410","display_name":"Iterative Viterbi decoding","level":5,"score":0.549126386642456},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5407519340515137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3597407937049866},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.335620641708374},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.30724698305130005},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.13624343276023865}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/globecom42002.2020.9322505","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom42002.2020.9322505","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2020 - 2020 IEEE Global Communications Conference","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":14,"referenced_works":["https://openalex.org/W1935265763","https://openalex.org/W1992890516","https://openalex.org/W2029017687","https://openalex.org/W2036102925","https://openalex.org/W2107402738","https://openalex.org/W2122057349","https://openalex.org/W2131092434","https://openalex.org/W2142009997","https://openalex.org/W2149072083","https://openalex.org/W2149775573","https://openalex.org/W2559059375","https://openalex.org/W2596263981","https://openalex.org/W2915299136","https://openalex.org/W2963829778"],"related_works":["https://openalex.org/W1915619113","https://openalex.org/W2544568790","https://openalex.org/W2921374214","https://openalex.org/W3194244515","https://openalex.org/W2361773811","https://openalex.org/W171822854","https://openalex.org/W1546736863","https://openalex.org/W123028466","https://openalex.org/W2510070518","https://openalex.org/W176266968"],"abstract_inverted_index":{"We":[0,76,98],"introduce":[1],"a":[2,17,45,106,124],"process":[3,49],"for":[4,13,73,89,118,138],"designing":[5],"the":[6,26,48,54,59,62,67,79,95,111,116,128,131],"optimal":[7],"cyclic":[8],"redundancy":[9],"check":[10],"(CRC)":[11],"code":[12,21],"each":[14,30,35,74,119],"input":[15,31,36],"of":[16,56,102,130],"given":[18],"\u03bainput":[19],"convolutional":[20],"(\u03ba":[22],"\u2265":[23],"1).":[24],"Using":[25],"free":[27],"distance":[28],"on":[29,115,123],"and":[32,81,109,135],"considering":[33],"that":[34,65],"sequence":[37],"can":[38],"correspond":[39],"to":[40,94],"multiple":[41],"error":[42,70],"events":[43],"in":[44,92,105],"\u03ba-input":[46,96,107,139],"CC,":[47],"efficiently":[50],"narrows":[51],"down":[52],"from":[53],"set":[55],"polynomials":[57],"with":[58],"same":[60],"degree":[61],"best":[63],"CRC":[64,133],"provides":[66],"minimum":[68],"frame":[69],"rate":[71],"(FER)":[72],"input.":[75,120],"also":[77],"extend":[78],"efficient":[80],"low":[82],"complexity":[83],"serial":[84],"list":[85],"Viterbi":[86],"algorithm":[87],"(SLVA)":[88],"single-input":[90],"CCs":[91],"[1]":[93],"case.":[97],"discuss":[99],"different":[100],"ways":[101],"integrating":[103],"CRCs":[104],"CC":[108,126],"derive":[110],"truncated":[112],"union":[113],"bound":[114],"FER":[117],"Numerical":[121],"examples":[122],"two-input":[125],"illustrate":[127],"effectiveness":[129],"proposed":[132],"design":[134],"SLVA":[136],"decoder":[137],"CCs.":[140]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}