{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T15:59:04Z","timestamp":1784131144180,"version":"3.55.0"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/tit.2019.2917683","type":"journal-article","created":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T21:45:46Z","timestamp":1558475146000},"page":"5656-5673","source":"Crossref","is-referenced-by-count":2,"title":["Upper and Lower Bounds on the Computational Complexity of Polar Encoding and Decoding"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7491-4700","authenticated-orcid":false,"given":"Christopher G.","family":"Blake","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4274-1785","authenticated-orcid":false,"given":"Frank R.","family":"Kschischang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref38","first-page":"448","article-title":"Faulty successive cancellation decoding of polar codes for the binary erasure channel","author":"balatsoukas-stimming","year":"2014","journal-title":"Proc Int Symp Inf Theory Appl"},{"key":"ref33","author":"patterson","year":"2014","journal-title":"Computer Organization and Design The Hardware\/Software Interface"},{"key":"ref32","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804401"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205856"},{"key":"ref37","article-title":"Efficient encoders and decoders for polar codes: Algorithms and implementations","author":"sarkis","year":"2016"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2080990"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7446995"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.5479\/sil.538961.39088011475779"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/T-ED.1979.19457","article-title":"cost and performance of vlsi computing structures","volume":"26","author":"mead","year":"1979","journal-title":"IEEE Transactions on Electron Devices"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2316365"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref12","first-page":"11","article-title":"Polar codes: A pipelined implementation","author":"arikan","year":"2010","journal-title":"Proceedings of ISB"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2371819"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2359197"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2616117"},{"key":"ref17","article-title":"Quantum circuits: Fanout, parity, and counting","author":"moore","year":"1999","journal-title":"arXiv quant-ph\/9903046"},{"key":"ref18","article-title":"Rekursive codes mit der plotkin-konstruktion und ihre decodierung","author":"stolte","year":"2002"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2016.2525020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/49.1921"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2421520"},{"key":"ref27","author":"stevens","year":"1971","journal-title":"A fast Fourier transform subroutine for Illiac IV"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284015"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2865701"},{"key":"ref29","article-title":"Energy consumption of error control coding circuits","author":"blake","year":"2017"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673805"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8007001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504276"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2365777"},{"key":"ref9","article-title":"A complexity theory for VLSI","author":"thompson","year":"1980"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.R2493"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2014.2327336"},{"key":"ref45","article-title":"Computational limitations for small depth circuits","author":"h\u00e5stad","year":"1986"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2228295"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946819"},{"key":"ref47","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","author":"greenlaw","year":"1995","journal-title":"Limits to Parallel Computation P-Completeness Theory"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.101811.111480"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2015.7112042"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80041-4"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638137"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref44","first-page":"689","article-title":"Asymptotische abschatzugen in Shannon’s informationstheorie","author":"strassen","year":"1962","journal-title":"Proc Trans 3rd Prague Conf Inf Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-001-1026-2"},{"key":"ref43","first-page":"1","article-title":"A 4.68 Gb\/s belief propagation polar decoder with bit-splitting register file","author":"park","year":"2014","journal-title":"Symp VLSI Circuits Dig Tech Papers"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90056-2"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8804391\/08719012.pdf?arnumber=8719012","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:05Z","timestamp":1657745525000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8719012\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":48,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2917683","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,9]]}}}