{"id":"https://openalex.org/W2737501407","doi":"https://doi.org/10.1109/lcomm.2017.2730860","title":"Improved Successive-Cancellation Decoding of Polar Codes Based on Recursive Syndrome Decomposition","display_name":"Improved Successive-Cancellation Decoding of Polar Codes Based on Recursive Syndrome Decomposition","publication_year":2017,"publication_date":"2017-07-24","ids":{"openalex":"https://openalex.org/W2737501407","doi":"https://doi.org/10.1109/lcomm.2017.2730860","mag":"2737501407"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2017.2730860","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2017.2730860","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications Letters","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/A5113166987","display_name":"Jaejoon Choi","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jaejoon Choi","raw_affiliation_strings":["School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087977408","display_name":"In\u2010Cheol Park","orcid":"https://orcid.org/0000-0003-3524-2838"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"In-Cheol Park","raw_affiliation_strings":["School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-3524-2838","affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4394,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.67297742,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"21","issue":"11","first_page":"2344","last_page":"2347"},"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.991599977016449,"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/T12029","display_name":"DNA and Biological Computing","score":0.987500011920929,"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.74901282787323},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6012060642242432},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5720705986022949},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.5427423119544983},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5163101553916931},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.49561989307403564},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.44384124875068665},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4367567002773285},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43059226870536804},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.41853421926498413},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41845810413360596},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31659600138664246},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.27611300349235535},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1613168716430664},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1125924289226532}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.74901282787323},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6012060642242432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5720705986022949},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.5427423119544983},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5163101553916931},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.49561989307403564},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.44384124875068665},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4367567002773285},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43059226870536804},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.41853421926498413},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41845810413360596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31659600138664246},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.27611300349235535},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1613168716430664},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1125924289226532},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2017.2730860","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2017.2730860","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2003204237","https://openalex.org/W2032948086","https://openalex.org/W2051270424","https://openalex.org/W2072100797","https://openalex.org/W2084346236","https://openalex.org/W2150498905","https://openalex.org/W2163509114","https://openalex.org/W2515736724"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2102627024","https://openalex.org/W2369600518","https://openalex.org/W2050784748","https://openalex.org/W4244153028","https://openalex.org/W1866038923","https://openalex.org/W1980817751","https://openalex.org/W2182594114","https://openalex.org/W1548705449","https://openalex.org/W2370284973"],"abstract_inverted_index":{"In":[0],"this":[1],"letter":[2],"an":[3],"improved":[4],"method":[5,81],"for":[6,87],"the":[7,34,55,75,79,83,95],"successive-cancellation":[8],"decoding":[9],"of":[10,27,38],"polar":[11,28,91],"codes":[12,29],"is":[13,66],"proposed.":[14],"To":[15],"avoid":[16],"computations":[17],"associated":[18],"with":[19,74],"redundant":[20],"tree-traversals":[21],"and":[22],"syndrome":[23,41,47,56,63],"calculations,":[24],"recursive":[25],"properties":[26],"are":[30,49],"newly":[31],"exploited":[32],"in":[33],"proposed":[35,67,80],"algorithm.":[36],"Instead":[37],"computing":[39],"a":[40,61,88],"vector":[42,57],"at":[43],"every":[44],"node,":[45],"some":[46],"vectors":[48],"directly":[50],"obtained":[51],"by":[52,85],"recursively":[53],"decomposing":[54],"computed":[58],"previously.":[59],"Furthermore,":[60],"modified":[62],"check":[64],"rule":[65],"to":[68],"prune":[69],"unnecessary":[70],"sub-trees":[71],"efficiently.":[72],"Compared":[73],"latest":[76],"pruning":[77],"method,":[78],"reduces":[82],"latency":[84],"23%":[86],"(2048,":[89],"1024)":[90],"code":[92],"without":[93],"sacrificing":[94],"error-correcting":[96],"performance.":[97]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}