{"id":"https://openalex.org/W4415368272","doi":"https://doi.org/10.1109/isit63088.2025.11195629","title":"Optimal Linear Map Decoding of Convolutional Codes","display_name":"Optimal Linear Map Decoding of Convolutional Codes","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415368272","doi":"https://doi.org/10.1109/isit63088.2025.11195629"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-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/A5100448724","display_name":"Yonghui Li","orcid":"https://orcid.org/0000-0001-7702-1123"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Yonghui Li","raw_affiliation_strings":["School of Electrical and Compter Engineering, the University of Sydney,Sydney,NSW 2006"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Compter Engineering, the University of Sydney,Sydney,NSW 2006","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075605659","display_name":"Chentao Yue","orcid":"https://orcid.org/0000-0001-5877-2319"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Chentao Yue","raw_affiliation_strings":["School of Electrical and Compter Engineering, the University of Sydney,Sydney,NSW 2006"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Compter Engineering, the University of Sydney,Sydney,NSW 2006","institution_ids":["https://openalex.org/I129604602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043371405","display_name":"Branka Vucetic","orcid":"https://orcid.org/0000-0002-2700-2001"},"institutions":[{"id":"https://openalex.org/I129604602","display_name":"University of Sydney","ror":"https://ror.org/0384j8v12","country_code":"AU","type":"education","lineage":["https://openalex.org/I129604602"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Branka Vucetic","raw_affiliation_strings":["School of Electrical and Compter Engineering, the University of Sydney,Sydney,NSW 2006"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Compter Engineering, the University of Sydney,Sydney,NSW 2006","institution_ids":["https://openalex.org/I129604602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100448724"],"corresponding_institution_ids":["https://openalex.org/I129604602"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.37457552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9840999841690063,"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.9840999841690063,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9783999919891357,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7993999719619751},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.7074000239372253},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6705999970436096},{"id":"https://openalex.org/keywords/maximum-a-posteriori-estimation","display_name":"Maximum a posteriori estimation","score":0.534500002861023},{"id":"https://openalex.org/keywords/encoder","display_name":"Encoder","score":0.5092999935150146},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.4875999987125397},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.46389999985694885},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.4410000145435333}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7993999719619751},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7074000239372253},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6705999970436096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6421999931335449},{"id":"https://openalex.org/C9810830","wikidata":"https://www.wikidata.org/wiki/Q635384","display_name":"Maximum a posteriori estimation","level":3,"score":0.534500002861023},{"id":"https://openalex.org/C118505674","wikidata":"https://www.wikidata.org/wiki/Q42586063","display_name":"Encoder","level":2,"score":0.5092999935150146},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.4875999987125397},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.46389999985694885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45590001344680786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4496999979019165},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.4410000145435333},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.41029998660087585},{"id":"https://openalex.org/C64948573","wikidata":"https://www.wikidata.org/wiki/Q625117","display_name":"BCJR algorithm","level":5,"score":0.4027000069618225},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.367900013923645},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.2971999943256378},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2842000126838684},{"id":"https://openalex.org/C3561768","wikidata":"https://www.wikidata.org/wiki/Q5275267","display_name":"Difference-map algorithm","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.26980000734329224},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.266400009393692},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.260699987411499}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","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":11,"referenced_works":["https://openalex.org/W1727295893","https://openalex.org/W1991133427","https://openalex.org/W2035227369","https://openalex.org/W2038358713","https://openalex.org/W2045407304","https://openalex.org/W2087362480","https://openalex.org/W2120513570","https://openalex.org/W2149072083","https://openalex.org/W2272901026","https://openalex.org/W2963746143","https://openalex.org/W3157677848"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,11,17,115,147],"linear":[6,31],"representation":[7],"of":[8,16,73,127,149],"BCJR":[9,110],"maximum":[10],"posteriori":[12],"probability":[13],"(MAP)":[14],"decoding":[15,33,43,64,103,118,134],"rate":[18],"<tex":[19,150],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[20,151],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$1":[21],"/":[22],"2$</tex>":[23],"convolutional":[24],"code":[25],"(CC),":[26],"referred":[27],"to":[28,88],"as":[29,108],"the":[30,38,48,71,101,105,109,121,125,128,136,157],"MAP":[32,39,63,111],"(LMAP).":[34],"We":[35],"discover":[36],"that":[37,100],"forward":[40,75],"and":[41,53,76,91,153,161],"backward":[42,77],"can":[44,66,93],"be":[45,67,94],"implemented":[46],"by":[47,69,142],"corresponding":[49],"dual":[50,78],"soft":[51,54],"input":[52],"output":[55,65],"(SISO)":[56],"encoders":[57],"using":[58,81],"shift":[59],"registers.":[60],"The":[61],"bidrectional":[62],"obtained":[68],"combining":[70],"contents":[72],"respective":[74],"encoders.":[79],"Represented":[80],"simple":[82],"shift-registers,":[83],"LMAP":[84,102,133],"decoder":[85],"maps":[86],"naturally":[87],"hardware":[89],"registers":[90],"thus":[92],"easily":[95],"implemented.":[96],"Simulation":[97],"results":[98],"demonstrate":[99],"achieves":[104],"same":[106],"performance":[107],"decoding,":[112],"but":[113],"has":[114],"significantly":[116],"reduced":[117],"delay.":[119],"For":[120],"block":[122],"length":[123,130],"64,":[124],"CC":[126],"memory":[129],"14":[131],"with":[132],"surpasses":[135],"random":[137],"coding":[138],"union":[139],"(RCU)":[140],"bound":[141],"approximately":[143],"0.5":[144],"dB":[145],"at":[146],"BLER":[148],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$10^{-3}$</tex>,":[152],"closely":[154],"approaches":[155],"both":[156],"normal":[158],"approximation":[159],"(NA)":[160],"meta-converse":[162],"(MC)":[163],"bounds.":[164]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-21T00:00:00"}