{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:36:44Z","timestamp":1774679804512,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384323","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"552-564","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity"],"prefix":"10.1145","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrii","family":"Riazanov","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Ye","sequence":"additional","affiliation":[{"name":"Tsinghua-Berkeley Shenzhen Institute, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.800480"},{"key":"e_1_3_2_1_4_1","volume-title":"2017 IEEE Information Theory Workshop (ITW). IEEE, 101-105","author":"Benammar M.","unstructured":"M. Benammar , V. Bioglio , F. Gabry , and I. Land . 2017. Multi-kernel polar codes: Proof of polarization and error exponents . In 2017 IEEE Information Theory Workshop (ITW). IEEE, 101-105 . M. Benammar, V. Bioglio, F. Gabry, and I. Land. 2017. Multi-kernel polar codes: Proof of polarization and error exponents. In 2017 IEEE Information Theory Workshop (ITW). IEEE, 101-105."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188816"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2496308"},{"key":"e_1_3_2_1_7_1","unstructured":"Arman Fazeli S. Hamed Hassani Marco Mondelli and Alexander Vardy. 2017. Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity. ArXiv e-prints (Nov. 2017 ). arXiv:cs.IT\/1711.01339  Arman Fazeli S. Hamed Hassani Marco Mondelli and Alexander Vardy. 2017. Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity. ArXiv e-prints (Nov. 2017 ). arXiv:cs.IT\/1711.01339"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028536"},{"key":"e_1_3_2_1_10_1","unstructured":"G. David Forney. 2005. On exponential error bounds for random codes on the BSC. Lecture notes ( 2005 ). Available at http:\/\/web.mit.edu\/6.441\/spring05\/reading\/Forney_ExpEBBSC.pdf.  G. David Forney. 2005. On exponential error bounds for random codes on the BSC. Lecture notes ( 2005 ). Available at http:\/\/web.mit.edu\/6.441\/spring05\/reading\/Forney_ExpEBBSC.pdf."},{"key":"e_1_3_2_1_11_1","volume-title":"2017 IEEE International Conference on Communications Workshops ( ICC Workshops). IEEE, 761-765","author":"Gabry F.","unstructured":"F. Gabry , V. Bioglio , I. Land , and J. Belfiore . 2017. Multi-kernel construction of polar codes . In 2017 IEEE International Conference on Communications Workshops ( ICC Workshops). IEEE, 761-765 . F. Gabry, V. Bioglio, I. Land, and J. Belfiore. 2017. Multi-kernel construction of polar codes. In 2017 IEEE International Conference on Communications Workshops ( ICC Workshops). IEEE, 761-765."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359197"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371819"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034105"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"e_1_3_2_1_18_1","volume-title":"The theory of error-correcting codes","author":"MacWilliams Florence Jessie","unstructured":"Florence Jessie MacWilliams and Neil James Alexander Sloane . 1977. The theory of error-correcting codes . Vol. 16 . Elsevier . Florence Jessie MacWilliams and Neil James Alexander Sloane. 1977. The theory of error-correcting codes. Vol. 16. Elsevier."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404639"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616117"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"},{"key":"e_1_3_2_1_22_1","volume-title":"IEEE International Symposium on Information Theory, ISIT. 215-219","author":"Henry","unstructured":"Henry D. Pfister and R\u00fcdiger L. Urbanke. 2016. Near-optimal finite-length scaling for polar codes over large alphabets . In IEEE International Symposium on Information Theory, ISIT. 215-219 . Henry D. Pfister and R\u00fcdiger L. Urbanke. 2016. Near-optimal finite-length scaling for polar codes over large alphabets. In IEEE International Symposium on Information Theory, ISIT. 215-219."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"e_1_3_2_1_24_1","article-title":"Mixed-kernels constructions of polar codes","volume":"34","author":"Presman Noam","year":"2015","unstructured":"Noam Presman , Ofer Shapira , and Simon Litsyn . 2015 . Mixed-kernels constructions of polar codes . IEEE Journal on Selected Areas in Communications 34 , 2 ( 2015 ), 239-253. Noam Presman, Ofer Shapira, and Simon Litsyn. 2015. Mixed-kernels constructions of polar codes. IEEE Journal on Selected Areas in Communications 34, 2 ( 2015 ), 239-253.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Claude Elwood Shannon. 1948. A mathematical theory of communication. Bell system technical journal 27 3 ( 1948 ) 379-423.  Claude Elwood Shannon. 1948. A mathematical theory of communication. Bell system technical journal 27 3 ( 1948 ) 379-423.","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_3_2_1_26_1","volume-title":"Trans. 3rd Prague Conf. Info. Theory. 689-723","author":"Strassen Volker","year":"1962","unstructured":"Volker Strassen . 1962 . Asymptotische Abschatzungen in Shannon's Informationstheories . In Trans. 3rd Prague Conf. Info. Theory. 689-723 . Volker Strassen. 1962. Asymptotische Abschatzungen in Shannon's Informationstheories. In Trans. 3rd Prague Conf. Info. Theory. 689-723."},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. Trans. 3rd Prague Conf. Inf. Theory. 689-723","author":"Strassen Volker","year":"2009","unstructured":"Volker Strassen . 2009 . Asymptotic estimates in Shannon's information theory . In Proc. Trans. 3rd Prague Conf. Inf. Theory. 689-723 . Volker Strassen. 2009. Asymptotic estimates in Shannon's information theory. In Proc. Trans. 3rd Prague Conf. Inf. Theory. 689-723."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"e_1_3_2_1_29_1","volume-title":"Code Rate, and Error Probability. ( 2018 ). arXiv","author":"Wang Hsin-Po","year":"1812","unstructured":"Hsin-Po Wang and Iwan Duursma . 2018. Polar-like Codes and Asymptotic Tradeof among Block Length , Code Rate, and Error Probability. ( 2018 ). arXiv : 1812 .08112. Hsin-Po Wang and Iwan Duursma. 2018. Polar-like Codes and Asymptotic Tradeof among Block Length, Code Rate, and Error Probability. ( 2018 ). arXiv: 1812.08112."},{"key":"e_1_3_2_1_30_1","volume-title":"Duursma","author":"Wang Hsin-Po","year":"2019","unstructured":"Hsin-Po Wang and Iwan M . Duursma . 2019 . Polar Codes' Simplicity, Random Codes' Durability. ArXiv abs\/ 1912.08995 ( 2019 ). Hsin-Po Wang and Iwan M. Duursma. 2019. Polar Codes' Simplicity, Random Codes' Durability. ArXiv abs\/ 1912.08995 ( 2019 )."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Jacob Wolfowitz. 1957. The coding of messages subject to chance errors. Illinois J. Math. 1 ( 1957 ) 591-606.  Jacob Wolfowitz. 1957. The coding of messages subject to chance errors. Illinois J. Math. 1 ( 1957 ) 591-606.","DOI":"10.1215\/ijm\/1255380682"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849741"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282451"}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384323","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384323","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:32:57Z","timestamp":1750199577000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":32,"alternative-id":["10.1145\/3357713.3384323","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384323","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}