{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:00:00Z","timestamp":1773378000590,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834407","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2148-2153","source":"Crossref","is-referenced-by-count":1,"title":["Binary Polar Codes Based on Bit Error Probability"],"prefix":"10.1109","author":[{"given":"Jun","family":"Muramatsu","sequence":"first","affiliation":[{"name":"NTT Corporation,NTT Communication Science Laboratories,Japan"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989260"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518163"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033724"},{"key":"ref13","first-page":"259","article-title":"Polarization and polar codes","volume":"8","author":"?a?o?lu","year":"2012","journal-title":"Foundations Trends Commun Inf Theory"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513567"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3016605"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283641"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2765663"},{"key":"ref2","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":"it 55","author":"ar?kan","year":"2009","journal-title":"IEEE Trans Inform Theory"},{"key":"ref1","article-title":"Re-proving channel polarization theorems: a extremality and robustness analysis","author":"alsan","year":"2015"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834407.pdf?arnumber=9834407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:49Z","timestamp":1773347749000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834407\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834407","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}