{"id":"https://openalex.org/W2991327005","doi":"https://doi.org/10.1145/3357713.3384323","title":"Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity","display_name":"Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity","publication_year":2020,"publication_date":"2020-06-07","ids":{"openalex":"https://openalex.org/W2991327005","doi":"https://doi.org/10.1145/3357713.3384323","mag":"2991327005"},"language":"en","primary_location":{"id":"doi:10.1145/3357713.3384323","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384323","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384323","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384323","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068388812","display_name":"Venkatesan Guruswami","orcid":"https://orcid.org/0000-0001-7926-3396"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Venkatesan Guruswami","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066919379","display_name":"Andrii Riazanov","orcid":"https://orcid.org/0000-0002-5173-7614"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrii Riazanov","raw_affiliation_strings":["Carnegie Mellon University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100725244","display_name":"Min Ye","orcid":"https://orcid.org/0000-0003-1351-8880"},"institutions":[{"id":"https://openalex.org/I4210114105","display_name":"Tsinghua\u2013Berkeley Shenzhen Institute","ror":"https://ror.org/02hhwwz98","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210114105","https://openalex.org/I95457486","https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Min Ye","raw_affiliation_strings":["Tsinghua-Berkeley Shenzhen Institute, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tsinghua-Berkeley Shenzhen Institute, China","institution_ids":["https://openalex.org/I4210114105"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.3419,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.88423517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"552","last_page":"564"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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.9983999729156494,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.7858017683029175},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7074307203292847},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6746209859848022},{"id":"https://openalex.org/keywords/noisy-channel-coding-theorem","display_name":"Noisy-channel coding theorem","score":0.6567674875259399},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5930042862892151},{"id":"https://openalex.org/keywords/binary-symmetric-channel","display_name":"Binary symmetric channel","score":0.5632146596908569},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5090186595916748},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.4967985451221466},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4484165906906128},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3468679189682007},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3391093611717224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3359192907810211},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.33330589532852173},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.29877543449401855},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.13934797048568726},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10761240124702454}],"concepts":[{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.7858017683029175},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7074307203292847},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6746209859848022},{"id":"https://openalex.org/C103073706","wikidata":"https://www.wikidata.org/wiki/Q2345282","display_name":"Noisy-channel coding theorem","level":5,"score":0.6567674875259399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5930042862892151},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.5632146596908569},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5090186595916748},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.4967985451221466},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4484165906906128},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3468679189682007},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3391093611717224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3359192907810211},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.33330589532852173},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.29877543449401855},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.13934797048568726},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10761240124702454}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3357713.3384323","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384323","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384323","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3357713.3384323","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3357713.3384323","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3357713.3384323","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4202698560","display_name":"CIF: Medium: Collaborative Research: Frontiers in coding for cloud storage systems","funder_award_id":"1563742","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5200908636","display_name":"CIF/AF: Small: Some fundamental complexity-inspired coding theory challenges","funder_award_id":"1422045","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320310207","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2991327005.pdf","grobid_xml":"https://content.openalex.org/works/W2991327005.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W1588709600","https://openalex.org/W1680362028","https://openalex.org/W1971123554","https://openalex.org/W1975096885","https://openalex.org/W1993944611","https://openalex.org/W1995875735","https://openalex.org/W1999697648","https://openalex.org/W2036491047","https://openalex.org/W2055534149","https://openalex.org/W2065465262","https://openalex.org/W2096667287","https://openalex.org/W2106864314","https://openalex.org/W2142213376","https://openalex.org/W2145712176","https://openalex.org/W2150498905","https://openalex.org/W2164368671","https://openalex.org/W2169017678","https://openalex.org/W2245941765","https://openalex.org/W2531627753","https://openalex.org/W2570893422","https://openalex.org/W2963852187","https://openalex.org/W2963962111","https://openalex.org/W2975023189","https://openalex.org/W3102122722","https://openalex.org/W4365800100","https://openalex.org/W6600238479","https://openalex.org/W6690753635"],"related_works":["https://openalex.org/W2069151199","https://openalex.org/W2127041286","https://openalex.org/W2133351463","https://openalex.org/W2096475427","https://openalex.org/W2521161426","https://openalex.org/W2532394005","https://openalex.org/W2042522304","https://openalex.org/W1970907073","https://openalex.org/W4310820012","https://openalex.org/W2987150391"],"abstract_inverted_index":{"Let":[0],"W":[1,43],"be":[2,81],"a":[3,89,101,109,122],"binary-input":[4],"memoryless":[5],"symmetric":[6],"(BMS)":[7],"channel":[8],"with":[9,44,65,95,114],"Shannon":[10,118],"capacity":[11,77,99],"I(W)":[12],"and":[13,35,48],"fix":[14],"any":[15,22],"\u03b1":[16],">":[17,26],"0.":[18],"We":[19],"construct,":[20],"for":[21,127],"sufficiently":[23],"small":[24],"\u03b4":[25,75],"0,":[27],"binary":[28,129],"linear":[29],"codes":[30,59],"of":[31,57,92,103,117],"block":[32,66,105],"length":[33,67],"O(1/\u03b42+\u03b1)":[34],"rate":[36],"I(W)\u2212\u03b4":[37],"that":[38],"enable":[39],"reliable":[40],"communication":[41],"on":[42,72],"quasi-linear":[45],"time":[46],"encoding":[47],"decoding.":[49],"Shannon\u2019s":[50,93],"noisy":[51],"coding":[52],"theorem":[53,94],"established":[54],"the":[55,73,82,104,115,128],"existence":[56],"such":[58,121],"(without":[60],"efficient":[61],"constructions":[62],"or":[63],"decoding)":[64],"O(1/\u03b42).":[68],"This":[69,107],"quadratic":[70],"dependence":[71],"gap":[74],"to":[76,80,98],"is":[78],"known":[79,126],"best":[83],"possible.":[84],"Our":[85],"result":[86,123],"thus":[87],"yields":[88],"constructive":[90],"version":[91],"near-optimal":[96],"convergence":[97],"as":[100],"function":[102],"length.":[106],"resolves":[108],"central":[110],"theoretical":[111],"challenge":[112],"associated":[113],"attainment":[116],"capacity.":[119],"Previously":[120],"was":[124],"only":[125],"erasure":[130],"channel.":[131]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}