{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:17:30Z","timestamp":1775913450429,"version":"3.50.1"},"reference-count":16,"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.9834782","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2374-2378","source":"Crossref","is-referenced-by-count":13,"title":["Polar Codes Do Not Have Many Affine Automorphisms"],"prefix":"10.1109","author":[{"given":"Kirill","family":"Ivanov","sequence":"first","affiliation":[{"name":"École Polytechnique Fédérale de Lausanne (EPFL),School of Computer and Communication Sciences,Lausanne,Switzerland,CH-1015"}]},{"given":"R\u00fcdiger","family":"Urbanke","sequence":"additional","affiliation":[{"name":"École Polytechnique Fédérale de Lausanne (EPFL),School of Computer and Communication Sciences,Lausanne,Switzerland,CH-1015"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3121442"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541295"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3098798"},{"key":"ref13","first-page":"1","article-title":"The Complete Affine Automorphism Group of Polar Codes","author":"li","year":"2021","journal-title":"2021 IEEE Glob Commun Conf (GLOBECOM)"},{"key":"ref14","first-page":"195","article-title":"On the dependency between the code symmetries and the decoding efficiency","author":"ivanov","year":"0"},{"key":"ref15","article-title":"Reed-Muller Codes Achieve Capacity on BMS Channels","author":"reeves","year":"2021"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2341919"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518184"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854333"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611504"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/REDUNDANCY48165.2019.9003333"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.090312.121501"},{"key":"ref7","article-title":"Classification of Automorphisms for the Decoding of Polar Codes","author":"pillet","year":"2021"},{"key":"ref2","article-title":"NR; Multiplexing and channel coding","year":"0","journal-title":"3rd Generation Partnership Project (3GPP) Technical Specification (TS) 38 212 01 2019 version 15 4 0"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504269"}],"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\/09834782.pdf?arnumber=9834782","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:55Z","timestamp":1773347695000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834782\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834782","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}