{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T13:25:08Z","timestamp":1774358708646,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200020_146832\/1"],"award-info":[{"award-number":["200020_146832\/1"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021-121903"],"award-info":[{"award-number":["200021-121903"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1109\/tit.2014.2341919","type":"journal-article","created":{"date-parts":[[2014,7,25]],"date-time":"2014-07-25T18:42:06Z","timestamp":1406313726000},"page":"5875-5898","source":"Crossref","is-referenced-by-count":110,"title":["Finite-Length Scaling for Polar Codes"],"prefix":"10.1109","volume":"60","author":[{"given":"Seyed Hamed","family":"Hassani","sequence":"first","affiliation":[]},{"given":"Kasra","family":"Alishahi","sequence":"additional","affiliation":[]},{"given":"Rudiger L.","family":"Urbanke","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691215"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394827"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513579"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513585"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283641"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","author":"godsil","year":"2001","journal-title":"Algebraic Graph Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033724"},{"key":"ref18","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198534938.001.0001","author":"rahman","year":"2002","journal-title":"Analytic Theory of Polynomials (London Mathematical Society Monographs)"},{"key":"ref19","author":"parizi","year":"2013","journal-title":"On the Correlation between Polarized BECs"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"3100","DOI":"10.1109\/TCOMM.2013.070213.120789","article-title":"Improved successive cancellation decoding of polar codes","volume":"61","author":"niu","year":"2013","journal-title":"IEEE Trans Commun"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2228295"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691213"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref6","first-page":"689","article-title":"Asymptotische Absch atzungen in Shannon’s informationstheorie","author":"strassen","year":"1962","journal-title":"Proc 3D Prague Conf Inf Theory"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874809"},{"key":"ref5","first-page":"211","article-title":"Mathematical problems in the Shannon theory of optimal coding of information","volume":"1","author":"dobrushin","year":"1961","journal-title":"Proc 4th Berkeley Symp Math Statist Probab"},{"key":"ref8","article-title":"Polar codes for channel and source coding","author":"korada","year":"2009"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1965.1053730"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205857"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.41"},{"key":"ref22","author":"goldin","year":"2013","journal-title":"Improved Bounds on the Finite Length Scaling of Polar Codes"},{"key":"ref21","article-title":"Polarization and spatial coupling: Two techniques to boost performance","author":"hassani","year":"2013"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2010.5613813"},{"key":"ref23","author":"tal","year":"2013","journal-title":"List decoding of polar codes"},{"key":"ref26","author":"mahdavifar","year":"2013","journal-title":"Performance Limits and Practical Decoding of Interleaved Reed-solomon Polar Concatenated Codes"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.111612.121898"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6895347\/06866198.pdf?arnumber=6866198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,31]],"date-time":"2024-05-31T11:28:41Z","timestamp":1717154921000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6866198\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":30,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2014.2341919","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10]]}}}