{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:57:53Z","timestamp":1775145473112,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206681","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1723-1728","source":"Crossref","is-referenced-by-count":7,"title":["New Search for the Polarization-Adjusted Convolutional Codes with Respect to the AFER-Optimality Criterion"],"prefix":"10.1109","author":[{"given":"Murad","family":"Abdullah","sequence":"first","affiliation":[{"name":"The Hong Kong University of Science and Technology,Department of Electronic and Computer Engineering"}]},{"given":"Wai Ho","family":"Mow","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology,Department of Electronic and Computer Engineering"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834587"},{"key":"ref12","article-title":"Error coefficient-improved polar\/PAC codes","author":"rowshan","year":"2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611478"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC51071.2022.9771578"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2020.2979529"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2018.1800181"},{"key":"ref1","year":"2018","journal-title":"3GPP TS 22 261 Service requirements for the 5G system Stage 1 (Release 18)"},{"key":"ref17","year":"2021","journal-title":"Algorithms and Programming Version 4 11 1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/18.382038"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3052550"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205860"},{"key":"ref24","article-title":"Bounds on the minimum distance of linear codes and quantum codes","author":"grassl","year":"2007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.111612.121898"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/26.536908"},{"key":"ref25","first-page":"1","article-title":"Minimum-distance based construction of multikernel polar codes","author":"bioglio","year":"2017","journal-title":"Proc IEEE Global Communications Conference (GLOBECOM)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"},{"key":"ref22","volume":"18","author":"betten","year":"2006","journal-title":"Error-Correcting Linear Codes Classification by Isometry and Applications"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849539"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2908870"},{"key":"ref9","article-title":"From sequential decoding to channel polarization and back again","author":"ar?kan","year":"2019"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref6","first-page":"1","article-title":"Polar code construction for list decoding","author":"yuan","year":"2019","journal-title":"Proc 12th International ITG Conference on Systems Communications and Coding"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504269"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206681.pdf?arnumber=10206681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:41Z","timestamp":1773347201000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206681\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206681","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}