{"id":"https://openalex.org/W2975829198","doi":"https://doi.org/10.1109/isit.2019.8849752","title":"Convolutional Decoding of Polar Codes","display_name":"Convolutional Decoding of Polar Codes","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975829198","doi":"https://doi.org/10.1109/isit.2019.8849752","mag":"2975829198"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","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/A5015830368","display_name":"Arman Fazeli","orcid":"https://orcid.org/0000-0001-8321-3391"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Arman Fazeli","raw_affiliation_strings":["University of California San Diego, La Jolla, CA, 92093, USA","University of California San Diego, La Jolla, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego, La Jolla, CA, 92093, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5004102644","display_name":"Alexander Vardy","orcid":"https://orcid.org/0000-0003-3303-9078"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Vardy","raw_affiliation_strings":["University of California San Diego, La Jolla, CA, 92093, USA","University of California San Diego, La Jolla, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego, La Jolla, CA, 92093, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010924440","display_name":"Hanwen Yao","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hanwen Yao","raw_affiliation_strings":["University of California San Diego, La Jolla, CA, 92093, USA","University of California San Diego, La Jolla, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California San Diego, La Jolla, CA, 92093, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":null,"apc_paid":null,"fwci":1.4422,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80729741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1397","last_page":"1401"},"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.9972000122070312,"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/T11130","display_name":"Coding theory and cryptography","score":0.9951000213623047,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.8439562916755676},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7518670558929443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7324262857437134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6950834393501282},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.6637125611305237},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.6251802444458008},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6216008067131042},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.6202552914619446},{"id":"https://openalex.org/keywords/cyclic-redundancy-check","display_name":"Cyclic redundancy check","score":0.5448548197746277},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.540172815322876},{"id":"https://openalex.org/keywords/viterbi-decoder","display_name":"Viterbi decoder","score":0.46581318974494934},{"id":"https://openalex.org/keywords/viterbi-algorithm","display_name":"Viterbi algorithm","score":0.4159505367279053},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36460965871810913},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.34343743324279785},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16818132996559143},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.15596550703048706}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.8439562916755676},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7518670558929443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7324262857437134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6950834393501282},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.6637125611305237},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.6251802444458008},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6216008067131042},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.6202552914619446},{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.5448548197746277},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.540172815322876},{"id":"https://openalex.org/C117379686","wikidata":"https://www.wikidata.org/wiki/Q6996459","display_name":"Viterbi decoder","level":3,"score":0.46581318974494934},{"id":"https://openalex.org/C60582962","wikidata":"https://www.wikidata.org/wiki/Q83886","display_name":"Viterbi algorithm","level":3,"score":0.4159505367279053},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36460965871810913},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.34343743324279785},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16818132996559143},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.15596550703048706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849752","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849752","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 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":24,"referenced_works":["https://openalex.org/W1991133427","https://openalex.org/W2033234285","https://openalex.org/W2064189613","https://openalex.org/W2106045225","https://openalex.org/W2150498905","https://openalex.org/W2161457263","https://openalex.org/W2164368671","https://openalex.org/W2193772905","https://openalex.org/W2230831824","https://openalex.org/W2284321898","https://openalex.org/W2525850160","https://openalex.org/W2605063494","https://openalex.org/W2610717994","https://openalex.org/W2772435313","https://openalex.org/W2773681515","https://openalex.org/W2783438090","https://openalex.org/W2879583790","https://openalex.org/W2963389341","https://openalex.org/W2964085716","https://openalex.org/W3098807857","https://openalex.org/W3100563676","https://openalex.org/W3106484160","https://openalex.org/W6727764323","https://openalex.org/W6735899628"],"related_works":["https://openalex.org/W1599365967","https://openalex.org/W4205451769","https://openalex.org/W2052976169","https://openalex.org/W2134727924","https://openalex.org/W2808151917","https://openalex.org/W99853930","https://openalex.org/W1504657239","https://openalex.org/W2010879611","https://openalex.org/W4386352854","https://openalex.org/W2608571523"],"abstract_inverted_index":{"Polar":[0],"coding":[1],"has":[2],"found":[3],"its":[4,82],"way":[5],"into":[6],"many":[7],"realms":[8],"in":[9,163],"communications":[10],"and":[11,92,167,204],"information":[12],"theory.":[13],"In":[14],"most":[15,225],"implementation":[16],"setups,":[17],"they":[18],"are":[19,86,130,139,230],"accompanied":[20],"with":[21,115,132,189,237],"the":[22,40,48,54,75,101,107,112,160,164,171,180,184,190,201,227,242,270],"list":[23],"successive":[24,42],"cancellation":[25,43],"(LSC)":[26],"decoding":[27,45,50,153,173,187],"algorithm":[28,154,244],"which":[29,85,104,138,158,264],"is":[30,51,100,169],"shown":[31,93,140],"to":[32,39,63,72,80,141,207,222,245,267],"provide":[33],"a":[34,151,213,218,232],"superior":[35,59,143],"error":[36,77,181],"performance":[37,60,78,109],"compared":[38],"original":[41,185],"(SC)":[44],"method.":[46],"While":[47],"SC":[49,186],"fairly":[52],"well-studied,":[53],"exact":[55],"math":[56],"behind":[57],"LSC's":[58,76,108],"still":[61],"remains":[62],"be":[64],"of":[65,183,192,200,217,226],"mystery.":[66],"Multiple":[67],"techniques":[68,161],"have":[69,142],"been":[70],"proposed":[71,255],"further":[73],"improve":[74],"or":[79],"reduce":[81],"computational":[83],"complexity,":[84],"usually":[87],"motivated":[88],"by":[89,110,211],"heuristic":[90],"reasons":[91],"through":[94],"numerical":[95],"simulations.":[96],"Most":[97],"notable":[98],"example":[99],"CRC-aided":[102,146,202],"LSC,":[103],"drastically":[105],"improves":[106],"concatenating":[111],"polar":[113,127,238],"code":[114,215,273],"some":[116,198],"high-rate":[117,135],"cyclic":[118],"redundancy":[119],"check":[120],"(CRC)":[121],"codes.In":[122],"this":[123,252],"paper,":[124],"we":[125,178],"present":[126,150],"codes":[128,157,229,250],"that":[129],"concatenated":[131],"an":[133],"underlying":[134,261],"convolutional":[136,172,214,228,249,262,272],"code,":[137,263],"performances":[144],"over":[145],"LSC.":[147],"We":[148,196,240],"also":[149],"computationally-efficient":[152],"for":[155,235,251,269],"these":[156],"resembles":[159],"used":[162],"Viterbi":[165],"algorithm,":[166],"hence":[168],"called":[170],"algorithm.":[174],"To":[175],"do":[176],"this,":[177],"revisit":[179],"analysis":[182],"along":[188],"concept":[191],"Ar\u0131kan's":[193],"helper":[194],"genie.":[195],"address":[197],"shortcomings":[199],"LSC":[203],"discuss":[205],"how":[206],"turn":[208],"around":[209],"them":[210],"emulating":[212],"instead":[216],"CRC":[219,223],"code.":[220],"Contrary":[221],"codes,":[224],"not":[231],"proper":[233],"choice":[234],"concatenation":[236],"codes.":[239],"introduce":[241],"bucketing":[243],"construct":[246],"suitable":[247],"punctured":[248],"purpose.":[253],"The":[254],"framework":[256],"can":[257],"accommodate":[258],"any":[259],"such":[260],"allows":[265],"one":[266],"search":[268],"optimal":[271],"based":[274],"on":[275],"their":[276],"design":[277],"parameters.":[278]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}