{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:58:03Z","timestamp":1773377883982,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"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":[[2019,7]]},"DOI":"10.1109\/isit.2019.8849445","type":"proceedings-article","created":{"date-parts":[[2019,9,26]],"date-time":"2019-09-26T21:46:12Z","timestamp":1569534372000},"page":"1412-1416","source":"Crossref","is-referenced-by-count":10,"title":["Reduced complexity window processing of binary polarization kernels"],"prefix":"10.1109","author":[{"given":"Grigorii","family":"Trofimiuk","sequence":"first","affiliation":[{"name":"ITMO University, Russia"}]},{"given":"Peter","family":"Trifonov","sequence":"additional","affiliation":[{"name":"ITMO University, Russia"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437559"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875379"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006852"},{"key":"ref15","article-title":"Design of Randomized Polar Subcodes with Non-Arikan Kernels","author":"trifonov","year":"2018","journal-title":"Proc Int Workshop on Algebraic and Combinatorial Coding Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409257"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028536"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613307"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/WCNCW.2017.7919042"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970857"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020309101422"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2018.8613428"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2323237"}],"event":{"name":"2019 IEEE International Symposium on Information Theory (ISIT)","location":"Paris, France","start":{"date-parts":[[2019,7,7]]},"end":{"date-parts":[[2019,7,12]]}},"container-title":["2019 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8827389\/8849208\/08849445.pdf?arnumber=8849445","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:27Z","timestamp":1773347727000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8849445\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2019.8849445","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]}}}