{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:04:19Z","timestamp":1730279059251,"version":"3.28.0"},"reference-count":32,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/itw.2018.8613428","type":"proceedings-article","created":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T00:39:34Z","timestamp":1547771974000},"page":"1-5","source":"Crossref","is-referenced-by-count":22,"title":["Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels"],"prefix":"10.1109","author":[{"given":"Arman","family":"Fazeli","sequence":"first","affiliation":[]},{"given":"Hamed","family":"Hassani","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Mondelli","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Vardy","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/18.312184"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359197"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.41"},{"journal-title":"Polarization and Spatial Coupling Two Techniques to Boost Performance","year":"2013","author":"hassani","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437453"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2228295"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2030478"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513579"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref27","first-page":"259","article-title":", Polarization and polar codes","volume":"8","author":"?a?ogl?","year":"2012","journal-title":"Foundations and Trends in Communications and Information Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref6","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 Mathematics Statistics and Probability"},{"key":"ref29","article-title":"Asymptotische abschätzungen in Shannon’s informationstheorie","author":"strassen","year":"1962","journal-title":"Trans 3rd Prague Conf Inf Theory"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028536"},{"article-title":"Binary linear codes with optimal scaling and quasi-linear complexity","year":"0","author":"fazeli","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"journal-title":"Concatenated Codes","year":"1966","author":"forney","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.2009580"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2345069"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2789885"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616117"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2453315"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"journal-title":"Near-optimal finite-length scaling for polar codes over large alphabets May 2016","year":"0","author":"pfister","key":"ref25"}],"event":{"name":"2018 IEEE Information Theory Workshop (ITW)","start":{"date-parts":[[2018,11,25]]},"location":"Guangzhou","end":{"date-parts":[[2018,11,29]]}},"container-title":["2018 IEEE Information Theory Workshop (ITW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8598908\/8613300\/08613428.pdf?arnumber=8613428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T23:46:31Z","timestamp":1643240791000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8613428\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/itw.2018.8613428","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}