{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:19Z","timestamp":1773377959809,"version":"3.50.1"},"reference-count":15,"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"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834657","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2142-2147","source":"Crossref","is-referenced-by-count":3,"title":["Adjacent-Bits-Swapped Polar codes: A new code construction to speed up polarization"],"prefix":"10.1109","author":[{"given":"Guodong","family":"Li","sequence":"first","affiliation":[{"name":"Shandong University,School of Cyber Science and Technology,Qingdao,China"}]},{"given":"Min","family":"Ye","sequence":"additional","affiliation":[{"name":"Tsinghua-Berkeley Shenzhen Institute,Tsinghua Shenzhen International Graduate School,Shenzhen,China"}]},{"given":"Sihuang","family":"Hu","sequence":"additional","affiliation":[{"name":"Shandong University,Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education,Qingdao,China"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023487"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834657"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174087"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3098798"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2673829"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2014.2345069"},{"key":"ref5","article-title":"Reed-Muller codes achieve capacity on BMS channels","author":"reeves","year":"2021"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977917"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437453"}],"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\/09834657.pdf?arnumber=9834657","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:41Z","timestamp":1773347741000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834657\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834657","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}