{"id":"https://openalex.org/W2095970035","doi":"https://doi.org/10.1109/isit.2014.6875380","title":"Enabling complexity-performance trade-offs for successive cancellation decoding of polar codes","display_name":"Enabling complexity-performance trade-offs for successive cancellation decoding of polar codes","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2095970035","doi":"https://doi.org/10.1109/isit.2014.6875380","mag":"2095970035"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1307.5095","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Alexios Balatsoukas-Stimming","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Alexios Balatsoukas-Stimming","raw_affiliation_strings":["Telecommunications Circuits Laboratory, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"Telecommunications Circuits Laboratory, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Georgios Karakonstantis","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Georgios Karakonstantis","raw_affiliation_strings":["Telecommunications Circuits Laboratory, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"Telecommunications Circuits Laboratory, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":null,"display_name":"Andreas Burg","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Andreas Burg","raw_affiliation_strings":["Telecommunications Circuits Laboratory, EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"Telecommunications Circuits Laboratory, EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5124864"],"apc_list":null,"apc_paid":null,"fwci":1.7986,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.87456088,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2977","last_page":"2981"},"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.9943000078201294,"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.991100013256073,"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.6578999757766724},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.49309998750686646},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4674000144004822},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.40059998631477356},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.37299999594688416},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.3668999969959259},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.3465000092983246},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.3352999985218048},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3319999873638153}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6578999757766724},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6383000016212463},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.49309998750686646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4909999966621399},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4674000144004822},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.40059998631477356},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.37299999594688416},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3465000092983246},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.3352999985218048},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3319999873638153},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32829999923706055},{"id":"https://openalex.org/C29705727","wikidata":"https://www.wikidata.org/wiki/Q294562","display_name":"Polar","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C152139883","wikidata":"https://www.wikidata.org/wiki/Q252973","display_name":"Mutual information","level":2,"score":0.32010000944137573},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.3111000061035156},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.28870001435279846},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2809000015258789},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.273499995470047},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.26739999651908875},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2612999975681305},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2597000002861023}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/isit.2014.6875380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1307.5095","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1307.5095","pdf_url":"https://arxiv.org/pdf/1307.5095","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.qub.ac.uk/portal:publications/17510152-3485-4a9f-a7c2-9eecf0c99c7d","is_oa":true,"landing_page_url":"https://pure.qub.ac.uk/en/publications/17510152-3485-4a9f-a7c2-9eecf0c99c7d","pdf_url":"http://arxiv.org/abs/1307.5095","source":{"id":"https://openalex.org/S4306402319","display_name":"Research Portal (Queen's University Belfast)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I126231945","host_organization_name":"Queen's University Belfast","host_organization_lineage":["https://openalex.org/I126231945"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Balatsoukas-Stimming , A , Karakonstantis , G & Burg , A 2014 , Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes . in IEEE International Symposium on Information Theory - Proceedings . , 6875380 , Institute of Electrical and Electronics Engineers Inc. , pp. 2977-2981 . https://doi.org/10.1109/ISIT.2014.6875380","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.742.3749","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.742.3749","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1307.5095.pdf","raw_type":"text"},{"id":"pmh:oai:infoscience.epfl.ch:198247","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/198247","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:infoscience.epfl.ch:207189","is_oa":true,"landing_page_url":"http://infoscience.epfl.ch/record/207189","pdf_url":null,"source":{"id":"https://openalex.org/S4306400487","display_name":"Infoscience (Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1307.5095","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1307.5095","pdf_url":"https://arxiv.org/pdf/1307.5095","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1968235906","https://openalex.org/W1982515552","https://openalex.org/W1991066617","https://openalex.org/W2022608548","https://openalex.org/W2099419743","https://openalex.org/W2140253920","https://openalex.org/W2145565923","https://openalex.org/W2150498905","https://openalex.org/W2163509114","https://openalex.org/W2551106978"],"related_works":[],"abstract_inverted_index":{"Polar":[0],"codes":[1,70],"are":[2,20],"one":[3],"of":[4,37,45],"the":[5,34,46,78,100],"most":[6],"recent":[7],"advancements":[8],"in":[9,96],"coding":[10],"theory":[11],"and":[12,52],"they":[13,19,27],"have":[14,28],"attracted":[15],"significant":[16],"interest.":[17],"While":[18],"provably":[21],"capacity":[22],"achieving":[23],"over":[24],"various":[25],"channels,":[26],"seen":[29],"limited":[30],"practical":[31],"applications.":[32],"Unfortunately,":[33],"successive":[35,38],"nature":[36],"cancellation":[39],"based":[40,71,86],"decoders":[41],"hinders":[42],"fine-grained":[43],"adaptation":[44],"decoding":[47],"complexity":[48,79],"to":[49,98],"design":[50],"constraints":[51],"operating":[53],"conditions.":[54],"In":[55],"this":[56],"paper,":[57],"we":[58],"propose":[59],"a":[60,81,90],"systematic":[61],"method":[62],"for":[63,104],"enabling":[64],"complexity-performance":[65],"tradeoffs":[66],"by":[67],"constructing":[68],"polar":[69],"on":[72],"an":[73],"optimization":[74,101],"problem":[75,102],"which":[76],"minimizes":[77],"under":[80],"suitably":[82],"defined":[83],"mutual":[84],"information":[85],"performance":[87],"constraint.":[88],"Moreover,":[89],"low-complexity":[91],"greedy":[92],"algorithm":[93],"is":[94],"proposed":[95],"order":[97],"solve":[99],"efficiently":[103],"very":[105],"large":[106],"code":[107],"lengths.":[108]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2016-06-24T00:00:00"}