{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:47:20Z","timestamp":1775054840839,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/isit.2016.7541292","type":"proceedings-article","created":{"date-parts":[[2016,8,15]],"date-time":"2016-08-15T18:52:57Z","timestamp":1471287177000},"page":"215-219","source":"Crossref","is-referenced-by-count":20,"title":["Near-optimal finite-length scaling for polar codes over large alphabets"],"prefix":"10.1109","author":[{"given":"Henry D.","family":"Pfister","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, Duke University, United States of America"}]},{"given":"R\u00fcdiger","family":"Urbanke","sequence":"additional","affiliation":[{"name":"School of Computer and Communication Sciences, EPFL, Switzerland"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028536"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1993.748509"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2228295"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0021-1_7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541292"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359197"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"ankan","year":"2009","journal-title":"IEEE Trans Inform Theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371819"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282450"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282690"},{"key":"ref7","article-title":"An entropy sumset inequality and polynomially fast convergence to Shannon capacity over all alphabets","author":"guruswami","year":"2014","journal-title":"arXiv preprint arXiv 1411 6993"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00531927"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"}],"event":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","location":"Barcelona, Spain","start":{"date-parts":[[2016,7,10]]},"end":{"date-parts":[[2016,7,15]]}},"container-title":["2016 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7532279\/7541040\/07541292.pdf?arnumber=7541292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:53:36Z","timestamp":1774986816000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7541292\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2016.7541292","relation":{},"subject":[],"published":{"date-parts":[[2016,7]]}}}