{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T20:31:51Z","timestamp":1771705911879,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2024,2,1]]},"DOI":"10.1587\/transfun.2023eal2036","type":"journal-article","created":{"date-parts":[[2023,7,26]],"date-time":"2023-07-26T22:14:29Z","timestamp":1690409669000},"page":"187-191","source":"Crossref","is-referenced-by-count":2,"title":["Parity-Check Polarization-Adjusted Convolutional Coding"],"prefix":"10.1587","volume":"E107.A","author":[{"given":"Qingping","family":"YU","sequence":"first","affiliation":[{"name":"School of Electrical Engineer and Information, Southwest Petroleum University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You","family":"ZHANG","sequence":"additional","affiliation":[{"name":"School of Electrical Engineer and Information, Southwest Petroleum University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renze","family":"LUO","sequence":"additional","affiliation":[{"name":"School of Electrical Engineer and Information, Southwest Petroleum University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longye","family":"WANG","sequence":"additional","affiliation":[{"name":"School of Electrical Engineer and Information, Southwest Petroleum University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingwang","family":"LI","sequence":"additional","affiliation":[{"name":"School of Physics and Electronic Information Engineering, Henan Polytechnic University and the Jiaozuo Key Laboratory of Crow-Sensing Network"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] E. Arikan, \u201cChannel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels,\u201d IEEE Trans. Inf. Theory, vol.55, no.7, pp.3051-3073, July 2009. 10.1109\/tit.2009.2021379","DOI":"10.1109\/TIT.2009.2021379"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] I. Tal and A. Vardy, \u201cList decoding of polar codes,\u201d Proc. IEEE Int. Symp. Inf. Theory, pp.1-5, July 2011. 10.1109\/isit.2011.6033904","DOI":"10.1109\/ISIT.2011.6033904"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] K. Niu and K. Chen, \u201cCRC-aided decoding of polar codes,\u201d IEEE Commun. Lett., vol.16, no.10, pp.1668-1671, Oct. 2012. 10.1109\/lcomm.2012.090312.121501","DOI":"10.1109\/LCOMM.2012.090312.121501"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] T. Wang, D. Qu, and T. Jiang, \u201cParity-check-concatenated polar codes,\u201d IEEE Commun. Lett., vol.20, no.12, pp.2342-2345, Sept. 2016. 10.1109\/lcomm.2016.2607169","DOI":"10.1109\/LCOMM.2016.2607169"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] R. Mori and T. Tanaka, \u201cPerformance of polar codes with the construction using density evolution,\u201d IEEE Commun. Lett., vol.13, no.7, pp.519-521, July 2009. 10.1109\/lcomm.2009.090428","DOI":"10.1109\/LCOMM.2009.090428"},{"key":"6","doi-asserted-by":"publisher","unstructured":"[6] S.Y. Chung, T. Richardson, and R. Urbanke, \u201cAnalysis of sum-product decoding of low-density parity-check codes using a gaussian approximation,\u201d IEEE Trans. Inf. Theory, vol.47, no.2, pp.657-670, Feb. 2001. 10.1109\/18.910580","DOI":"10.1109\/18.910580"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] G. He, J.C. Belfiore, I. Land, G. Yang, X. Liu, Y. Chen, R. Li, J. Wang, Y. Ge, R. Zhang, and W. Tong, \u201cBeta-expansion: A theoretical framework for fast and recursive construction of polar codes,\u201d IEEE GLOBECOM, pp.1-6, Jan. 2017. 10.1109\/glocom.2017.8254146","DOI":"10.1109\/GLOCOM.2017.8254146"},{"key":"8","unstructured":"[8] H. Huawei Gothenburg, Sweden, \u201c3GPP. Channel coding for control channels,\u201d 3GPP TSG RAN WG1 Meeting#86 R1-167216, Aug. 2016."},{"key":"9","unstructured":"[9] E. Arikan, \u201cFrom sequential decoding to channel polarization and back again,\u201d Proc. ISIT, pp.5-14, Sept. 2019."},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] M. Rowshan, A. Burg, and E. Viterbo, \u201cPolarization-adjusted convolutional (PAC) codes: Sequential decoding vs list decoding,\u201d IEEE Trans. Veh. Technol., vol.70, no.2, pp.1434-1447, Jan. 2021. 10.1109\/tvt.2021.3052550","DOI":"10.1109\/TVT.2021.3052550"},{"key":"11","unstructured":"[11] H.Z. Bin, Li and G. Jiaqi, \u201cOn pre-transformed polar codes,\u201d arXiv:1912.06359, Dec. 2019. 10.48550\/arXiv.1912.06359"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] M. Rowshan and E. Viterbo, \u201cOn convolutional precoding in PAC codes,\u201d Proc. IEEE Globecom Workshops (GC Wkshps), pp.1-6, Dec. 2021. 10.1109\/gcwkshps52748.2021.9681987","DOI":"10.1109\/GCWkshps52748.2021.9681987"},{"key":"13","unstructured":"[13] S. Lin and D.J. Costello, Error Control Coding, Pearson Education India, 2004."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] H. Yao, A. Fazeli, and A. Vardy, \u201cList decoding of Ar\u0131kan's PAC codes,\u201d Proc. IEEE International Symposium on Information Theory (ISIT), pp.443-448, June 2020. 10.1109\/isit44484.2020.9174118","DOI":"10.1109\/ISIT44484.2020.9174118"},{"key":"15","doi-asserted-by":"publisher","unstructured":"[15] B. Li, H. Shen, and D. Tse, \u201cAn adaptive successive cancellation list decoder for polar codes with cyclic redundancy check,\u201d IEEE Commun. Lett., vol.16, no.12, pp.2044-2047, Dec. 2012. 10.1109\/lcomm.2012.111612.121898","DOI":"10.1109\/LCOMM.2012.111612.121898"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/2\/E107.A_2023EAL2036\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T03:24:18Z","timestamp":1706930658000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E107.A\/2\/E107.A_2023EAL2036\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,1]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2023eal2036","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,1]]},"article-number":"2023EAL2036"}}