{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T09:59:39Z","timestamp":1761559179454,"version":"build-2065373602"},"reference-count":33,"publisher":"Institution of Engineering and Technology (IET)","issue":"18","license":[{"start":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T00:00:00Z","timestamp":1725235200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["ietresearch.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["IET Communications"],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Recently, Ar\u0131kan proposed a polarization\u2010adjusted convolutional (PAC) codes, demonstrating their superior error correction performance over polar codes at short block lengths. It was confirmed that PAC codes approached the optimal performance achievable with limited code length. This paper proposes a novel low\u2010complexity list decoding algorithm for PAC codes, incorporating path splitting and pruning strategies based on a set of highly reliable information bits. Simulation results reveal that the proposed algorithm significantly reduces sorting complexity and average list size, all while incurring negligible performance loss. Unlike previous pruning algorithms designed for polar codes, the proposed strategy eliminates the need to individually assess the reliability of decoding paths in each decoding process. Instead, the algorithm minimizes redundant decoding paths through a high\u2010reliability information bit set, constructed using Monte Carlo\u00a0experiments.<\/jats:p>","DOI":"10.1049\/cmu2.12829","type":"journal-article","created":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T02:41:39Z","timestamp":1725331299000},"page":"1292-1299","update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A path splitting and pruning strategy on list decoder for PAC codes"],"prefix":"10.1049","volume":"18","author":[{"given":"Lei","family":"Lan","sequence":"first","affiliation":[{"name":"School of Information and Electronic Engineering Zhejiang University of Science and Technology Hangzhou China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongpeng","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information and Electronic Engineering Zhejiang University of Science and Technology Hangzhou China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5192-7418","authenticated-orcid":false,"given":"Lijuan","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information and Electronic Engineering Zhejiang University of Science and Technology Hangzhou China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"265","published-online":{"date-parts":[[2024,9,2]]},"reference":[{"key":"e_1_2_11_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"e_1_2_11_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2410251"},{"key":"e_1_2_11_4_1","doi-asserted-by":"publisher","DOI":"10.1049\/el.2011.3334"},{"key":"e_1_2_11_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.090312.121501"},{"key":"e_1_2_11_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2607169"},{"key":"e_1_2_11_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3106349"},{"key":"e_1_2_11_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.111612.121898"},{"key":"e_1_2_11_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2015.2504321"},{"key":"e_1_2_11_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2019.2894150"},{"key":"e_1_2_11_11_1","doi-asserted-by":"publisher","DOI":"10.1049\/cmu2.12153"},{"key":"e_1_2_11_12_1","unstructured":"Ar\u0131kan E.:From sequential decoding to channel polarization and back again.arXiv:190809594(2019)"},{"key":"e_1_2_11_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"e_1_2_11_14_1","unstructured":"Moradi M. Mozammel A. Qin K. Arikan E.:Performance and complexity of sequential decoding of PAC codes.arXiv:201204990(2020)"},{"key":"e_1_2_11_15_1","doi-asserted-by":"crossref","unstructured":"Moradi M. Mozammel A.:Concatenated reed\u2010solomon and polarization\u2010adjusted convolutional (PAC) codes.arXiv:210608822(2021)","DOI":"10.1109\/BlackSeaCom54372.2022.9858284"},{"key":"e_1_2_11_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3059370"},{"key":"e_1_2_11_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3052550"},{"key":"e_1_2_11_18_1","doi-asserted-by":"publisher","DOI":"10.3390\/e23070841"},{"key":"e_1_2_11_19_1","doi-asserted-by":"crossref","unstructured":"Yu Q. Shi Z.:Threshold\u2010based list decoding for PAC codes. In:2021 IEEE 21st International Conference on Communication Technology (ICCT) pp.1296\u20131299.IEEE Piscataway NJ(2021)","DOI":"10.1109\/ICCT52962.2021.9658042"},{"key":"e_1_2_11_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3069668"},{"key":"e_1_2_11_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC57237.2023.10273572"},{"key":"e_1_2_11_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3263225"},{"key":"e_1_2_11_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2023.3298847"},{"key":"e_1_2_11_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2023.3280548"},{"key":"e_1_2_11_25_1","doi-asserted-by":"crossref","unstructured":"Moradi M. Mozammel A.:A Monte\u2010Carlo based construction of polarization\u2010adjusted convolutional (PAC) codes.arXiv:210608118(2021)","DOI":"10.1109\/BlackSeaCom54372.2022.9858284"},{"key":"e_1_2_11_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.910580"},{"key":"e_1_2_11_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2439211"},{"key":"e_1_2_11_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043769"},{"key":"e_1_2_11_29_1","doi-asserted-by":"crossref","unstructured":"Afisiadis O. Balatsoukas Stimming A. Burg A.:A low\u2010complexity improved successive cancellation decoder for polar codes. In:2014 48th Asilomar Conference on Signals Systems and Computers pp.2116\u20132120.IEEE Piscataway NJ(2014)","DOI":"10.1109\/ACSSC.2014.7094848"},{"key":"e_1_2_11_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps52748.2021.9681987"},{"key":"e_1_2_11_31_1","doi-asserted-by":"crossref","unstructured":"Zhang Z. Qin K. Zhang L. Zhang H. Chen G.T.:Progressive bit\u2010flipping decoding of polar codes over layered critical sets. In:GLOBECOM 2017\u20102017 IEEE Global Communications Conference pp.1\u20136.IEEE Piscataway NJ(2017)","DOI":"10.1109\/GLOCOM.2017.8254149"},{"key":"e_1_2_11_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2011.101811.111480"},{"key":"e_1_2_11_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2018.8625267"},{"key":"e_1_2_11_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3111018"}],"container-title":["IET Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/pdf\/10.1049\/cmu2.12829","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T09:45:42Z","timestamp":1761558342000},"score":1,"resource":{"primary":{"URL":"https:\/\/ietresearch.onlinelibrary.wiley.com\/doi\/10.1049\/cmu2.12829"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,2]]},"references-count":33,"journal-issue":{"issue":"18","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["10.1049\/cmu2.12829"],"URL":"https:\/\/doi.org\/10.1049\/cmu2.12829","archive":["Portico"],"relation":{},"ISSN":["1751-8628","1751-8636"],"issn-type":[{"type":"print","value":"1751-8628"},{"type":"electronic","value":"1751-8636"}],"subject":[],"published":{"date-parts":[[2024,9,2]]},"assertion":[{"value":"2024-02-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-02","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}