{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:43Z","timestamp":1740131683633,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1545143"],"award-info":[{"award-number":["1545143"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/tit.2019.2915595","type":"journal-article","created":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T20:25:17Z","timestamp":1557347117000},"page":"5643-5655","source":"Crossref","is-referenced-by-count":4,"title":["Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5521-4397","authenticated-orcid":false,"given":"Henry D.","family":"Pfister","sequence":"first","affiliation":[]},{"given":"Rudiger L.","family":"Urbanke","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359197"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028536"},{"key":"ref13","first-page":"42","article-title":"An entropy sumset inequality and polynomially fast convergence to Shannon capacity over all alphabets","author":"guruswami","year":"2015","journal-title":"Proc Conf Comp Complex"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409257"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371819"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282450"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616117"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592755"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030478"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595172"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513579"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref2","first-page":"1","article-title":"On the distribution of mutual information","author":"laneman","year":"2006","journal-title":"Proc Annu Workshop Inf Theory Appl"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2228295"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531927"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1993.748509"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0021-1_7"},{"journal-title":"Binary linear codes with optimal scaling and quasi-linear complexity","year":"2017","author":"fazeli","key":"ref21"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.2307\/2314805"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050230"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8804391\/8709690-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8804391\/08709690.pdf?arnumber=8709690","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:05Z","timestamp":1657745525000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8709690\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":25,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2915595","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}