{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T16:27:36Z","timestamp":1768408056161,"version":"3.49.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"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":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tcomm.2023.3280548","type":"journal-article","created":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T17:33:04Z","timestamp":1685381584000},"page":"4425-4436","source":"Crossref","is-referenced-by-count":9,"title":["Application of Guessing to Sequential Decoding of Polarization-Adjusted Convolutional (PAC) Codes"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7026-0682","authenticated-orcid":false,"given":"Mohsen","family":"Moradi","sequence":"first","affiliation":[{"name":"Department of Electrical and Electronics Engineering, Bilkent University, Ankara, Turkey"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834587"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2924016"},{"key":"ref12","article-title":"A Monte-Carlo based construction of polarization-adjusted convolutional (PAC) codes","author":"moradi","year":"2021","journal-title":"arXiv 2106 08118"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2607169"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3069668"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2014.2323237"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC51071.2022.9771578"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1049\/el.2012.1459"},{"key":"ref31","article-title":"On pre-transformed polar codes","author":"li","year":"2019","journal-title":"arXiv 1912 06359"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3004749"},{"key":"ref11","author":"viterbi","year":"1979","journal-title":"Principles of Digital Communication and Coding"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2013.6691213"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3255254"},{"key":"ref32","article-title":"Performance of CRC concatenated pre-transformed RM-polar codes","author":"li","year":"2021","journal-title":"arXiv 2104 07486"},{"key":"ref2","article-title":"From sequential decoding to channel polarization and back again","author":"ar?kan","year":"2019","journal-title":"arXiv 1908 09594"},{"key":"ref1","article-title":"Performance and computational analysis of polarization-adjusted convolutional (PAC) codes","author":"moradi","year":"2022"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2793887"},{"key":"ref39","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006852"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437559"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2022.3209082"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.864443"},{"key":"ref23","first-page":"263","article-title":"Efficient maximum-likelihood decoding of Reed–Müller RM(m-3, m) codes","author":"thangaraj","year":"2020","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"5779","DOI":"10.1109\/TIT.2022.3173152","article-title":"An information-theoretic perspective on successive cancellation list decoding and polar code design","volume":"68","author":"co?kun","year":"2022","journal-title":"IEEE Trans Inf Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3098798"},{"key":"ref25","first-page":"1","article-title":"Decoding Reed–Müller and polar codes by successive factor graph permutations","author":"hashemi","year":"2018","journal-title":"Proc IEEE 10th Int Symp Turbo Codes Iterative Inf Process (ISTC)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504300"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394764"},{"key":"ref22","first-page":"1076","article-title":"Sequential decoding of high-rate Reed–Müller codes","author":"kamenev","year":"2021","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"ref21","first-page":"39","article-title":"A class of multiple-error-correcting codes and the decoding scheme","volume":"it 4","author":"reed","year":"1954","journal-title":"IRE Trans Inf Theory"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2309679"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2977917"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437637"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174087"},{"key":"ref8","first-page":"13","article-title":"Some sequential decoding procedures","volume":"2","author":"zigangirov","year":"1966","journal-title":"Probl Peredachi Inf"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057827"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1147\/rd.136.0675"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3111018"},{"key":"ref3","article-title":"Performance and complexity of sequential decoding of PAC codes","author":"moradi","year":"2020","journal-title":"arXiv 2012 04990"},{"key":"ref6","article-title":"Sequential decoding for reliable communication","author":"wozencraft","year":"1957"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.481781"},{"key":"ref40","volume":"290","author":"wozencraft","year":"1961","journal-title":"Sequential Decoding"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/10219032\/10138089.pdf?arnumber=10138089","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:58:57Z","timestamp":1693850337000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10138089\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":45,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2023.3280548","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}