{"id":"https://openalex.org/W3098720984","doi":"https://doi.org/10.1109/iccc49849.2020.9238903","title":"A Low Complexity Successive Cancellation List Decoding Algorithm of Polar Codes","display_name":"A Low Complexity Successive Cancellation List Decoding Algorithm of Polar Codes","publication_year":2020,"publication_date":"2020-08-09","ids":{"openalex":"https://openalex.org/W3098720984","doi":"https://doi.org/10.1109/iccc49849.2020.9238903","mag":"3098720984"},"language":"en","primary_location":{"id":"doi:10.1109/iccc49849.2020.9238903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccc49849.2020.9238903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/CIC International Conference on Communications in China (ICCC)","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/A5100675224","display_name":"Jiansong Miao","orcid":"https://orcid.org/0000-0002-7798-2407"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiansong Miao","raw_affiliation_strings":["Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113899900","display_name":"Weijie Li","orcid":"https://orcid.org/0000-0003-0023-5398"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weijie Li","raw_affiliation_strings":["Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5032732110","display_name":"Xuejia Hu","orcid":null},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuejia Hu","raw_affiliation_strings":["Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China","institution_ids":["https://openalex.org/I139759216"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015278979","display_name":"Hairui Li","orcid":"https://orcid.org/0000-0002-8170-8013"},"institutions":[{"id":"https://openalex.org/I139759216","display_name":"Beijing University of Posts and Telecommunications","ror":"https://ror.org/04w9fbh59","country_code":"CN","type":"education","lineage":["https://openalex.org/I139759216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hairui Li","raw_affiliation_strings":["Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Laboratory of Advanced Information Networks, Beijing University of Posts and Telecommunications, Beijing, People's Republic of China","institution_ids":["https://openalex.org/I139759216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I139759216"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17303306,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1010","last_page":"1015"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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.9998000264167786,"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/T12029","display_name":"DNA and Biological Computing","score":0.9940999746322632,"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"}},{"id":"https://openalex.org/T10207","display_name":"Advanced biosensing and bioanalysis techniques","score":0.9912999868392944,"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.8525965213775635},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7723116874694824},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.7518912553787231},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.656436562538147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.634909451007843},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.55567467212677},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5313000679016113},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.496343195438385},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4590531587600708},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.44307252764701843},{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.4423788785934448},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3281645178794861},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1147952675819397}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8525965213775635},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7723116874694824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7518912553787231},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.656436562538147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.634909451007843},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.55567467212677},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5313000679016113},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.496343195438385},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4590531587600708},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.44307252764701843},{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.4423788785934448},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3281645178794861},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1147952675819397},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccc49849.2020.9238903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccc49849.2020.9238903","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE/CIC International Conference on Communications in China (ICCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7099999785423279,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3785751192","display_name":null,"funder_award_id":"19L2034","funder_id":"https://openalex.org/F4320322919","funder_display_name":"Natural Science Foundation of Beijing Municipality"}],"funders":[{"id":"https://openalex.org/F4320322919","display_name":"Natural Science Foundation of Beijing Municipality","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1981735015","https://openalex.org/W2028139933","https://openalex.org/W2033234285","https://openalex.org/W2106045225","https://openalex.org/W2117009122","https://openalex.org/W2150498905","https://openalex.org/W2228116382","https://openalex.org/W3104806422"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2154603729","https://openalex.org/W2127999627","https://openalex.org/W2010879611","https://openalex.org/W2115785601"],"abstract_inverted_index":{"Polar":[0],"codes":[1],"are":[2,92],"the":[3,29,35,58,63,99,104,107,116,127,133],"first":[4],"provably":[5],"capacity-achieving":[6],"novel":[7],"channel":[8],"codes.":[9],"Successive":[10],"cancellation":[11],"list":[12],"(SCL)":[13],"decoding":[14,22,60,64,100,136],"algorithm":[15,50,129],"has":[16],"a":[17,39,67,76],"performance":[18],"close":[19],"to":[20,71,94],"maximum-likelihood":[21],"when":[23],"code":[24],"length":[25],"is":[26,31,51,69,79,86,110,118],"finite,":[27],"though":[28],"complexity":[30,36,134],"high.":[32],"To":[33],"reduce":[34,132],"of":[37,66,115,135,140],"SCL,":[38],"partial":[40],"path":[41,84,109],"expansion":[42,85],"with":[43,137],"segmented":[44,96],"check":[45,105],"and":[46,82,102,121],"pruning":[47],"SCL":[48],"(PPE-SCP-SCL)":[49],"proposed":[52,128],"in":[53],"this":[54],"paper.":[55],"Based":[56],"on":[57],"successive":[59],"structure,":[61],"if":[62,103],"result":[65],"bit":[68],"judged":[70],"be":[72],"reliable":[73],"enough,":[74],"then":[75],"hard":[77],"decision":[78],"made":[80],"directly":[81,111],"no":[83],"necessary.":[87],"Moreover,":[88],"several":[89],"parity-check":[90,97],"points":[91],"introduced":[93],"perform":[95],"during":[98],"process,":[101],"fails,":[106],"current":[108],"abandoned.":[112],"The":[113],"rationality":[114],"operations":[117],"theoretically":[119],"verified,":[120],"numerical":[122],"simulations":[123],"also":[124],"verify":[125],"that":[126],"can":[130],"significantly":[131],"trivial":[138],"loss":[139],"error":[141],"performance.":[142]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}