{"id":"https://openalex.org/W2976224847","doi":"https://doi.org/10.1109/isit.2019.8849539","title":"How to Modify Polar Codes for List Decoding","display_name":"How to Modify Polar Codes for List Decoding","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2976224847","doi":"https://doi.org/10.1109/isit.2019.8849539","mag":"2976224847"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849539","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849539","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":"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/A5075287436","display_name":"Mohammad Rowshan","orcid":"https://orcid.org/0000-0002-2199-5655"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Mohammad Rowshan","raw_affiliation_strings":["Monash University, Melbourne, VIC 3800, Australia"],"affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, VIC 3800, Australia","institution_ids":["https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043667125","display_name":"Emanuele Viterbo","orcid":"https://orcid.org/0000-0002-5861-2873"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Emanuele Viterbo","raw_affiliation_strings":["Monash University, Melbourne, VIC 3800, Australia"],"affiliations":[{"raw_affiliation_string":"Monash University, Melbourne, VIC 3800, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5075287436"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":2.7797,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.91369114,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1772","last_page":"1776"},"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.9947999715805054,"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.9919000267982483,"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.9026691913604736},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.7679486274719238},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.712864875793457},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6509464979171753},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6503657698631287},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6297537088394165},{"id":"https://openalex.org/keywords/reliability","display_name":"Reliability (semiconductor)","score":0.583406388759613},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5709418654441833},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.5700742602348328},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.532114565372467},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.5162250995635986},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4693145751953125},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.41954368352890015},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.34147781133651733},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.33411484956741333},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33279284834861755},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23101294040679932},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.13680759072303772},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11576008796691895},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.06476008892059326}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.9026691913604736},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.7679486274719238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.712864875793457},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6509464979171753},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6503657698631287},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6297537088394165},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.583406388759613},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5709418654441833},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.5700742602348328},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.532114565372467},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.5162250995635986},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4693145751953125},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.41954368352890015},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.34147781133651733},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.33411484956741333},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33279284834861755},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23101294040679932},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.13680759072303772},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11576008796691895},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.06476008892059326},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2019.8849539","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849539","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":[{"id":"https://metadata.un.org/sdg/16","score":0.6000000238418579,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1981735015","https://openalex.org/W2134750166","https://openalex.org/W2150498905","https://openalex.org/W2161541170","https://openalex.org/W2164368671","https://openalex.org/W2284321898","https://openalex.org/W2514963767","https://openalex.org/W2572884048","https://openalex.org/W2608866305","https://openalex.org/W2908007131","https://openalex.org/W2912637870","https://openalex.org/W2963449703","https://openalex.org/W2964039698"],"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/W2102627024","https://openalex.org/W2127999627","https://openalex.org/W2010879611","https://openalex.org/W2115785601"],"abstract_inverted_index":{"Polar":[0],"codes":[1,105],"are":[2],"constructed":[3],"based":[4],"on":[5],"the":[6,13,22,26,29,37,43,66,83,87,94],"reliability":[7],"of":[8,25,51,96,106,116],"bit-channels.":[9],"This":[10,49],"construction":[11,68],"suits":[12],"successive":[14,23],"cancellation":[15],"(SC)":[16],"decoding,":[17,36],"where":[18],"one":[19],"error":[20],"in":[21,32,42,58,74,86,93],"estimation":[24],"bits":[27,85],"fails":[28],"decoding.":[30],"However,":[31],"SC":[33],"list":[34,44,52],"(SCL)":[35],"correct":[38,97],"path":[39,98],"may":[40],"remain":[41],"by":[45,69],"tolerating":[46],"multiple":[47],"penalties.":[48],"characteristic":[50],"decoding":[53,113],"demands":[54],"a":[55,70,76,91],"different":[56],"approach":[57,78],"code":[59],"construction.":[60],"In":[61],"this":[62],"work,":[63],"we":[64],"modify":[65],"conventional":[67],"greedy":[71],"search":[72],"algorithm":[73],"which":[75],"bit-swapping":[77],"is":[79],"employed":[80],"to":[81],"re-distribute":[82],"low-reliability":[84],"subblocks":[88],"aiming":[89],"for":[90,103,120,126],"reduction":[92],"probability":[95],"elimination.":[99],"The":[100],"numerical":[101],"results":[102],"polar":[104],"length":[107],"1":[108],"kb":[109],"under":[110],"CRC-aided":[111],"SCL":[112],"show":[114],"improvements":[115],"about":[117],"0.4":[118],"dB":[119,125],"R=0.8":[121],"and":[122],"over":[123],"0.2":[124],"R=0.5":[127],"at":[128],"L=32.":[129]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}