{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:01:42Z","timestamp":1773378102804,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9518163","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2364-2368","source":"Crossref","is-referenced-by-count":4,"title":["Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization"],"prefix":"10.1109","author":[{"given":"Jun","family":"Muramatsu","sequence":"first","affiliation":[{"name":"NTT Corporation,NTT Communication Science Laboratories,Japan"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"ref3","first-page":"860","article-title":"Systematic polar coding","volume":"15","author":"ankan","year":"2010","journal-title":"IEEE Communications Letters"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989260"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2312181"},{"key":"ref8","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":"ref7","article-title":"Successive-cancellation decoding of binary polar codes based on symmetric parametrization","author":"muramatsu","year":"2021","journal-title":"Extended Version"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513567"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272694"},{"key":"ref1","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"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09518163.pdf?arnumber=9518163","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:18Z","timestamp":1773347778000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9518163\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9518163","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}