{"id":"https://openalex.org/W2518374686","doi":"https://doi.org/10.1109/isit.2016.7541412","title":"Simplified Successive-Cancellation List decoding of polar codes","display_name":"Simplified Successive-Cancellation List decoding of polar codes","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2518374686","doi":"https://doi.org/10.1109/isit.2016.7541412","mag":"2518374686"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2016.7541412","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541412","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/A5065261108","display_name":"Seyyed Ali Hashemi","orcid":"https://orcid.org/0000-0001-5679-8654"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Seyyed Ali Hashemi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, McGill University, Montr&#x00E9;al, Qu&#x00E9;bec, Canada","Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr&#x00E9;al, Qu&#x00E9;bec, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085812448","display_name":"Carlo Condo","orcid":"https://orcid.org/0000-0002-3050-036X"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Carlo Condo","raw_affiliation_strings":["Department of Electrical and Computer Engineering, McGill University, Montr&#x00E9;al, Qu&#x00E9;bec, Canada","Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr&#x00E9;al, Qu&#x00E9;bec, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091600002","display_name":"Warren J. Gross","orcid":"https://orcid.org/0000-0002-6226-6037"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Warren J. Gross","raw_affiliation_strings":["Department of Electrical and Computer Engineering, McGill University, Montr&#x00E9;al, Qu&#x00E9;bec, Canada","Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr&#x00E9;al, Qu&#x00E9;bec, Canada","institution_ids":["https://openalex.org/I5023651"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, McGill University, Montr\u00e9al, Qu\u00e9bec, Canada","institution_ids":["https://openalex.org/I5023651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5065261108"],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":5.7698,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.96269744,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"815","last_page":"819"},"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.9926999807357788,"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.9907000064849854,"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.8774608373641968},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.7348136305809021},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6910371780395508},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6455787420272827},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.644631564617157},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5974578857421875},{"id":"https://openalex.org/keywords/polar","display_name":"Polar","score":0.5812415480613708},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5811796188354492},{"id":"https://openalex.org/keywords/error-detection-and-correction","display_name":"Error detection and correction","score":0.465959370136261},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3536703586578369},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.24194523692131042},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1333135962486267}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8774608373641968},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.7348136305809021},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6910371780395508},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6455787420272827},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.644631564617157},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5974578857421875},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.5812415480613708},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5811796188354492},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.465959370136261},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3536703586578369},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.24194523692131042},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1333135962486267},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2016.7541412","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2016.7541412","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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":10,"referenced_works":["https://openalex.org/W2003204237","https://openalex.org/W2051270424","https://openalex.org/W2065673954","https://openalex.org/W2084346236","https://openalex.org/W2106045225","https://openalex.org/W2150498905","https://openalex.org/W2230831824","https://openalex.org/W2284321898","https://openalex.org/W2290407458","https://openalex.org/W3098807857"],"related_works":["https://openalex.org/W1599814246","https://openalex.org/W2963228343","https://openalex.org/W3106389544","https://openalex.org/W3080200660","https://openalex.org/W3196757433","https://openalex.org/W2417337632","https://openalex.org/W3167579671","https://openalex.org/W2976369658","https://openalex.org/W2290407458","https://openalex.org/W3099611555"],"abstract_inverted_index":{"The":[0,89],"Successive-Cancellation":[1],"List":[2],"(SCL)":[3],"decoding":[4],"algorithm":[5,92],"is":[6,19,93],"one":[7],"of":[8,35,48,64,103],"the":[9,33,36,45,62,65,78,83,101,107],"most":[10],"promising":[11],"approaches":[12],"towards":[13],"practical":[14],"polar":[15],"code":[16,97],"decoding.":[17],"It":[18],"able":[20],"to":[21,58],"provide":[22],"a":[23],"good":[24],"trade-off":[25],"between":[26],"error-correction":[27],"performance":[28],"and":[29,75,82,98],"complexity,":[30],"tunable":[31],"through":[32],"size":[34],"list.":[37],"In":[38],"this":[39],"paper,":[40],"we":[41],"show":[42],"that":[43,77],"in":[44,61],"conventional":[46,84],"formulation":[47],"SCL,":[49],"there":[50],"are":[51,87],"redundant":[52,73],"calculations":[53,74],"which":[54],"do":[55],"not":[56],"need":[57],"be":[59],"performed":[60],"course":[63],"algorithm.":[66],"We":[67],"simplify":[68],"SCL":[69,81,85,91,104],"by":[70],"removing":[71],"these":[72],"prove":[76],"proposed":[79],"simplified":[80,90],"algorithms":[86],"equivalent.":[88],"valid":[94],"for":[95],"any":[96],"can":[99],"reduce":[100],"time-complexity":[102],"without":[105],"affecting":[106],"space":[108],"complexity.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":7},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-21T06:30:42.041108","created_date":"2025-10-10T00:00:00"}
