{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T16:53:47Z","timestamp":1790268827241,"version":"4.1.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Packard Fellowship"},{"name":"MSR-CMU Center for Computational Thinking"},{"name":"NSF","award":["CCF-0963975"],"award-info":[{"award-number":["CCF-0963975"]}]},{"name":"NSF","award":["CCF-1422045"],"award-info":[{"award-number":["CCF-1422045"]}]},{"name":"NSF Graduate Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1109\/tit.2014.2371819","type":"journal-article","created":{"date-parts":[[2014,11,20]],"date-time":"2014-11-20T21:31:48Z","timestamp":1416519108000},"page":"3-16","source":"Crossref","is-referenced-by-count":59,"title":["Polar Codes: Speed of Polarization and Polynomial Gap to Capacity"],"prefix":"10.1109","volume":"61","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Xia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1215\/ijm\/1255380682","article-title":"The coding of messages subject to chance errors","volume":"1","author":"wolfowitz","year":"1957","journal-title":"Illinois J Math"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513574"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref10","article-title":"Improved bounds on the finite length scaling of polar codes","author":"goldin","year":"2013"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283641"},{"key":"ref12","first-page":"53","article-title":"Iterative decoding of low-density parity check codes","volume":"90","author":"guruswami","year":"2006","journal-title":"Bull EATCS"},{"key":"ref13","article-title":"An entropy sumset inequality and polynomially fast convergence to capacity over all alphabets","author":"guruswami","year":"2014"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.41"},{"key":"ref15","article-title":"Polarization and spatial coupling: Two techniques to boost performance","author":"hassani","year":"2013"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513585"},{"key":"ref17","article-title":"Finite-length scaling of polar codes","author":"hassani","year":"2013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513586"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283642"},{"key":"ref28","article-title":"Capacity achieving multiwrite WOM codes","author":"shpilka","year":"2012"},{"key":"ref4","article-title":"On the rate of channel polarization","author":"ar?kan","year":"2008"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033724"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513567"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513508"},{"key":"ref29","first-page":"689","article-title":"Asymptotische Abschätzungen in Shannon’s informationstheories","author":"strassen","year":"1962","journal-title":"Proc Trans 3rd Prague Conf Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref8","article-title":"Polarization for arbitrary discrete memoryless channels","author":"?a?o?lu","year":"2009"},{"key":"ref7","first-page":"259","article-title":"Polarization and polar codes","volume":"8","author":"?a?o?lu","year":"2012","journal-title":"Found Trends Commun Inf Theory"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref9","article-title":"Concatenated codes","author":"forney","year":"1967"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009580"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref22","article-title":"Polar codes for channel and source coding","author":"korada","year":"2009"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513579"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284229"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6994912\/06960872.pdf?arnumber=6960872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:27:50Z","timestamp":1642004870000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6960872"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":32,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2371819","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}