{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:40:09Z","timestamp":1725583209576},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1109\/ita.2015.7308970","type":"proceedings-article","created":{"date-parts":[[2015,10,29]],"date-time":"2015-10-29T18:04:22Z","timestamp":1446141862000},"page":"84-89","source":"Crossref","is-referenced-by-count":2,"title":["Binary kernel matrices of maximum exponents of polar codes of dimensions up to sixteen"],"prefix":"10.1109","author":[{"given":"Hsien-Ping","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khaled","family":"Abdel-Ghaffar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513568"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"},{"journal-title":"Binary Polar Code Kernels from Code Decompositions","year":"2011","author":"presman","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033859"},{"key":"ref4","first-page":"295","article-title":"Bounds on the size of linear codes","author":"brouwer","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref3","first-page":"1493","article-title":"On the rate of channel polarization","author":"ankan","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"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.212301"},{"article-title":"Polar Codes for Channel and Source Coding","year":"2009","author":"korada","key":"ref8"},{"journal-title":"Bounds on the minimum distance of linear codes","year":"2008","author":"grassl","key":"ref7"},{"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":"ankan","year":"2008","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"}],"event":{"name":"2015 Information Theory and Applications Workshop (ITA)","start":{"date-parts":[[2015,2,1]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2015,2,6]]}},"container-title":["2015 Information Theory and Applications Workshop (ITA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7152136\/7308952\/07308970.pdf?arnumber=7308970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,25]],"date-time":"2017-03-25T01:15:41Z","timestamp":1490404541000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7308970\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/ita.2015.7308970","relation":{},"subject":[],"published":{"date-parts":[[2015,2]]}}}