{"id":"https://openalex.org/W7204207010","doi":"https://doi.org/10.1109/isit62367.2026.11653806","title":"Simplified Successive Cancellation List Decoding of ABS+ Polar Codes","display_name":"Simplified Successive Cancellation List Decoding of ABS+ Polar Codes","publication_year":2026,"publication_date":"2026-06-01","ids":{"openalex":"https://openalex.org/W7204207010","doi":"https://doi.org/10.1109/isit62367.2026.11653806"},"language":"en","primary_location":{"id":"doi:10.1109/isit62367.2026.11653806","doi":"https://doi.org/10.1109/isit62367.2026.11653806","is_oa":true,"landing_page_url":"https://doi.org/10.1109/isit62367.2026.11653806","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W7204207010"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1109/isit62367.2026.11653806","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5123303593","display_name":"Mikhail Chernikov","orcid":"https://orcid.org/0009-0005-7131-4343","observed_orcids":["https://orcid.org/0009-0005-7131-4343"]},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Mikhail Chernikov","raw_affiliation_strings":["ITMO University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University","institution_ids":["https://openalex.org/I173089394"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016322127","display_name":"Peter Trifonov","orcid":"https://orcid.org/0000-0001-6960-0942","observed_orcids":["https://orcid.org/0000-0001-6960-0942"]},"institutions":[{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Peter Trifonov","raw_affiliation_strings":["ITMO University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ITMO University","institution_ids":["https://openalex.org/I173089394"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173089394"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9843999743461609,"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.9843999743461609,"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/T11130","display_name":"Coding theory and cryptography","score":0.011699999682605267,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.0003000000142492354,"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/successive-cancellation-list-decoding","display_name":"successive cancellation list decoding","score":0.9610000252723694},{"id":"https://openalex.org/keywords/polar-code-decoding","display_name":"polar code decoding","score":0.4449999928474426},{"id":"https://openalex.org/keywords/decoding-complexity","display_name":"decoding complexity","score":0.5299999713897705},{"id":"https://openalex.org/keywords/decoding-delay","display_name":"decoding latency","score":0.7929999828338623},{"id":"https://openalex.org/keywords/kernel-size","display_name":"kernel size","score":0.41100001335144043}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5940999984741211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5702999830245972},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5591999888420105},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.4034000039100647},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3790999948978424},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.35989999771118164},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.34040001034736633},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3352000117301941},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.3138999938964844},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3089999854564667},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3034000098705292},{"id":"https://openalex.org/C104267543","wikidata":"https://www.wikidata.org/wiki/Q208163","display_name":"Signal processing","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2678000032901764},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.26600000262260437},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.25429999828338623}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit62367.2026.11653806","doi":"https://doi.org/10.1109/isit62367.2026.11653806","is_oa":true,"landing_page_url":"https://doi.org/10.1109/isit62367.2026.11653806","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1109/isit62367.2026.11653806","doi":"https://doi.org/10.1109/isit62367.2026.11653806","is_oa":true,"landing_page_url":"https://doi.org/10.1109/isit62367.2026.11653806","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1940452936","https://openalex.org/W2003204237","https://openalex.org/W2051270424","https://openalex.org/W2099175407","https://openalex.org/W2106045225","https://openalex.org/W2150498905","https://openalex.org/W2518374686","https://openalex.org/W2610741500","https://openalex.org/W2911338190","https://openalex.org/W3093197399","https://openalex.org/W3128287493","https://openalex.org/W4289655298","https://openalex.org/W4388505172","https://openalex.org/W4400111765"],"related_works":["https://openalex.org/W7140783364","https://openalex.org/W2747504514","https://openalex.org/W2402546290","https://openalex.org/W2896549674","https://openalex.org/W2773467610","https://openalex.org/W2965035653","https://openalex.org/W2600907819","https://openalex.org/W7099246713","https://openalex.org/W3044998504","https://openalex.org/W2904004513"],"abstract_inverted_index":{"Recently":[0],"invented":[1],"ABS+":[2,22],"polar":[3,11,23,59,69],"codes":[4,24,70],"provide":[5],"substantially":[6],"faster":[7],"polarization":[8],"than":[9,54],"classical":[10,58],"codes.":[12,60],"We":[13],"present":[14],"the":[15,27,32,36,81,86],"simplified":[16,42],"version":[17],"of":[18,29,31,57],"SCL":[19,43],"decoding":[20,79],"for":[21],"that":[25],"implements":[26],"idea":[28],"pruning":[30],"recursion":[33],"tree":[34],"in":[35,66],"successive":[37],"algorithm.":[38],"The":[39],"proposed":[40],"fast":[41],"(FSSCL)":[44],"decoder":[45,56],"provides":[46],"better":[47],"tradeoff":[48],"between":[49],"performance":[50,82],"and":[51,83],"arithmetic":[52],"complexity":[53,84],"FSSCL":[55],"It":[61],"also":[62],"experiences":[63],"lower":[64],"latency":[65],"comparison":[67],"with":[68,71],"large":[72],"kernels":[73],"under":[74],"window":[75],"processing":[76],"(WP)":[77],"based":[78],"while":[80],"are":[85],"same.":[87]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-08-26T00:00:00"}