{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T20:19:54Z","timestamp":1725394794508},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282449","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"221-225","source":"Crossref","is-referenced-by-count":0,"title":["Binary nonlinear kernels of maximum exponents of polar codes of dimensions up to sixteen"],"prefix":"10.1109","author":[{"given":"Hsien-Ping","family":"Lin","sequence":"first","affiliation":[]},{"given":"Shu","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Khaled","family":"Abdel-Ghaffar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Polar codes for channel and source coding","year":"2009","author":"korada","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2015.7308970"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513568"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033859"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033859"},{"journal-title":"Binary polarization kernels from code decompositions","year":"2015","author":"presman","key":"ref17"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-009-9316-9"},{"key":"ref3","first-page":"1493","article-title":"On the rate of channel polarization","author":"arikan","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref6","article-title":"An algebraic approach to the association schemes of coding theory","author":"delsarte","year":"1973","journal-title":"Philips Res Rep Supp"},{"journal-title":"Table of General Binary Codes","year":"2012","author":"brouwer","key":"ref5"},{"journal-title":"Bounds on the minimum distance of linear codes","year":"2008","author":"grassl","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055665"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref1","first-page":"1173","article-title":"Channel polarization: A method for constructing capacity-achieving codes","author":"arikan","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/18.312154"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282449.pdf?arnumber=7282449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T16:51:38Z","timestamp":1490374298000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282449\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282449","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}