{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:44:04Z","timestamp":1773377044195,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2415440"],"award-info":[{"award-number":["CCF-2415440"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195375","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["PAC Codes with Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design"],"prefix":"10.1109","author":[{"given":"Mohsen","family":"Moradi","sequence":"first","affiliation":[{"name":"Northeastern University,Department of Electrical & Computer Engineering,Boston,USA,MA-02115"}]},{"given":"Hessam","family":"Mahdavifar","sequence":"additional","affiliation":[{"name":"Northeastern University,Department of Electrical & Computer Engineering,Boston,USA,MA-02115"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"From sequential decoding to channel polarization and back again","author":"Ar\u0131kan","year":"2019"},{"key":"ref2","volume-title":"Performance and complexity of sequential decoding of PAC codes","author":"Moradi","year":"2020"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref4","article-title":"Sequential decoding for reliable communication","volume":"325","author":"Wozencraft","year":"1957","journal-title":"Research Laboratory of Electronics, MIT, Cambridge, Tech. Rep."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057827"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054750"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3111018"},{"key":"ref8","volume-title":"On fast SC-based polar decoders: Metric polarization and a pruning technique","author":"Moradi","year":"2024"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1049\/el.2012.1459"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2323237"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437559"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA50346.2022.9870580"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/e23070841"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3052550"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834587"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3312678"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"102321","DOI":"10.1016\/j.ffa.2023.102321","article-title":"Polarization-adjusted convolutional (PAC) codes as a concatenation of inner cyclic and outer polarand Reed-Muller-like codes","volume":"93","author":"Moradi","year":"2024","journal-title":"Finite Fields and Their Applications"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref19","article-title":"A RM-polar codes","author":"Li","year":"2014","journal-title":"arXiv preprint"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3280548"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3331532"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691213"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2023.3249835"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.21236\/AD0621713"},{"key":"ref25","volume-title":"Principles of communication engineering","author":"Jacobs","year":"1965"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2945-6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.481781"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2021.3123270"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2023.3298847"},{"key":"ref30","volume-title":"Pac codes with bounded-complexity sequential decoding: Pareto distribution and code design","author":"Moradi","year":"2024"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1109\/ICC51166.2024.10622808","volume-title":"High-rate fair-density parity-check codes","author":"Mahdavifar","year":"2024"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195375.pdf?arnumber=11195375","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:30:17Z","timestamp":1773347417000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195375\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195375","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}