{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T16:42:35Z","timestamp":1775320955071,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T00:00:00Z","timestamp":1681948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s11432-022-3498-8","type":"journal-article","created":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T07:02:44Z","timestamp":1683874964000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A fast parallel SC-Fano decoding algorithm for PAC codes"],"prefix":"10.1007","volume":"66","author":[{"given":"Yunzhi","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pingzhi","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"3498_CR1","doi-asserted-by":"publisher","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","volume":"55","author":"E Arikan","year":"2009","unstructured":"Arikan E. Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans Inform Theor, 2009, 55: 3051\u20133073","journal-title":"IEEE Trans Inform Theor"},{"key":"3498_CR2","doi-asserted-by":"crossref","unstructured":"Tal I, Vardy A. List decoding of polar codes. In: Proceedings of 2011 IEEE International Symposium on Information Theory Proceedings, St. Petersburg, 2011. 1\u20135","DOI":"10.1109\/ISIT.2011.6033904"},{"key":"3498_CR3","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/LCOMM.2012.090312.121501","volume":"16","author":"K Niu","year":"2012","unstructured":"Niu K, Chen K. CRC-aided decoding of polar codes. IEEE Commun Lett, 2012, 16: 1668\u20131671","journal-title":"IEEE Commun Lett"},{"key":"3498_CR4","doi-asserted-by":"publisher","first-page":"2342","DOI":"10.1109\/LCOMM.2016.2607169","volume":"20","author":"T Wang","year":"2016","unstructured":"Wang T, Qu D, Jiang T. Parity-check-concatenated polar codes. IEEE Commun Lett, 2016, 20: 2342\u20132345","journal-title":"IEEE Commun Lett"},{"key":"3498_CR5","doi-asserted-by":"crossref","unstructured":"Zhang H, Li R, Wang J, et al. Parity-check polar coding for 5G and beyond. In: Proceedings of 2018 IEEE International Conference on Communications (ICC), Kansas City, 2018. 1\u20137","DOI":"10.1109\/ICC.2018.8422462"},{"key":"3498_CR6","unstructured":"Li B, Shen H, Tse D. A RM-polar codes. 2014. ArXiv:1407.5483"},{"key":"3498_CR7","unstructured":"Li B, Zhang H, Gu J. On pre-transformed polar codes. 2019. ArXiv:1912.06359"},{"key":"3498_CR8","unstructured":"Arikan E. From sequential decoding to channel polarization and back again. 2019. ArXiv:1908.09594"},{"key":"3498_CR9","doi-asserted-by":"publisher","first-page":"81682","DOI":"10.1109\/ACCESS.2019.2924016","volume":"7","author":"M O Jeong","year":"2019","unstructured":"Jeong M O, Hong S N. SC-Fano decoding of polar codes. IEEE Access, 2019, 7: 81682\u201381690","journal-title":"IEEE Access"},{"key":"3498_CR10","doi-asserted-by":"publisher","first-page":"2307","DOI":"10.1109\/TIT.2010.2043769","volume":"56","author":"Y Polyanskiy","year":"2010","unstructured":"Polyanskiy Y, Poor H V, Verdu S. Channel coding rate in the finite blocklength regime. IEEE Trans Inform Theor, 2010, 56: 2307\u20132359","journal-title":"IEEE Trans Inform Theor"},{"key":"3498_CR11","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/26.768759","volume":"47","author":"MPC Fossorier","year":"1999","unstructured":"Fossorier MPC, Mihaljevic M, Imai H. Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Trans Commun, 1999, 47: 673\u2013680","journal-title":"IEEE Trans Commun"},{"key":"3498_CR12","doi-asserted-by":"publisher","first-page":"7913","DOI":"10.1109\/TCOMM.2021.3111018","volume":"69","author":"M Moradi","year":"2021","unstructured":"Moradi M. On sequential decoding metric function of polarization-adjusted convolutional (PAC) codes. IEEE Trans Commun, 2021, 69: 7913\u20137922","journal-title":"IEEE Trans Commun"},{"key":"3498_CR13","doi-asserted-by":"publisher","first-page":"1434","DOI":"10.1109\/TVT.2021.3052550","volume":"70","author":"M Rowshan","year":"2021","unstructured":"Rowshan M, Burg A, Viterbo E. Polarization-adjusted convolutional (PAC) codes: sequential decoding vs list decoding. IEEE Trans Veh Technol, 2021, 70: 1434\u20131447","journal-title":"IEEE Trans Veh Technol"},{"key":"3498_CR14","doi-asserted-by":"crossref","unstructured":"Yao H, Fazeli A, Vardy A. List decoding of Arikan\u2019s PAC codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Los Angeles, 2020. 443\u2013448","DOI":"10.1109\/ISIT44484.2020.9174118"},{"key":"3498_CR15","doi-asserted-by":"publisher","first-page":"2428","DOI":"10.1109\/TVT.2021.3059370","volume":"70","author":"M Rowshan","year":"2021","unstructured":"Rowshan M, Viterbo E. List Viterbi decoding of PAC codes. IEEE Trans Veh Technol, 2021, 70: 2428\u20132435","journal-title":"IEEE Trans Veh Technol"},{"key":"3498_CR16","unstructured":"Moradi M, Mozammel A, Qin K, et al. Performance and complexity of sequential decoding of PAC codes. 2020. ArXiv:2012.04990"},{"key":"3498_CR17","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/TIT.1963.1057827","volume":"9","author":"R Fano","year":"1963","unstructured":"Fano R. A heuristic discussion of probabilistic decoding. IEEE Trans Inform Theor, 1963, 9: 64\u201374","journal-title":"IEEE Trans Inform Theor"},{"key":"3498_CR18","doi-asserted-by":"publisher","first-page":"3221","DOI":"10.1109\/TCOMM.2012.081512.110872","volume":"60","author":"P Trifonov","year":"2012","unstructured":"Trifonov P. Efficient design and decoding of polar codes. IEEE Trans Commun, 2012, 60: 3221\u20133227","journal-title":"IEEE Trans Commun"},{"key":"3498_CR19","doi-asserted-by":"crossref","unstructured":"Moradi M, Mozammel A. A Monte-Carlo based construction of polarization-adjusted convolutional (PAC) codes. 2021. ArXiv:2106.08118","DOI":"10.1109\/BlackSeaCom54372.2022.9858284"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-022-3498-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-022-3498-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-022-3498-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,18]],"date-time":"2024-06-18T20:20:12Z","timestamp":1718742012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-022-3498-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,20]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["3498"],"URL":"https:\/\/doi.org\/10.1007\/s11432-022-3498-8","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,20]]},"assertion":[{"value":"13 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"152301"}}