{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:02:54Z","timestamp":1757617374286,"version":"3.44.0"},"reference-count":15,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"9","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2025,9,1]]},"DOI":"10.1587\/transfun.2024eal2107","type":"journal-article","created":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T18:06:56Z","timestamp":1742753216000},"page":"1331-1335","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Concatenation Decoding Scheme of Polar Codes With Outer Reed-Solomon Codes"],"prefix":"10.1587","volume":"E108.A","author":[{"given":"Ke","family":"LIU","sequence":"first","affiliation":[{"name":"School of Microelectronics, Tianjin University"}]},{"given":"Wei","family":"ZHANG","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Tianjin University"}]},{"given":"Jianhan","family":"ZHAO","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Tianjin University"}]},{"given":"Yanyan","family":"LIU","sequence":"additional","affiliation":[{"name":"College of Electronic Information and Optical Engineering, Nankai University"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] E. Ar\u0131kan, \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":"publisher","unstructured":"[2] I. Tal and A. Vardy, \u201cList decoding of polar codes,\u201d IEEE Trans. Inf. Theory, vol.61, no.5, pp.2213-2226, May 2015. 10.1109\/tit.2015.2410251","DOI":"10.1109\/TIT.2015.2410251"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] D. Wu, A. Liu, Q. Zhang, and Y. Zhang, \u201cConcatenated polar codes based on selective polarization,\u201d Proc. ICCWAMTIP, pp.436-442, Dec. 2015. 10.1109\/iccwamtip.2015.7494026","DOI":"10.1109\/ICCWAMTIP.2015.7494026"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[4] A. Eslami and H. Pishro-Nik, \u201cOn finite-length performance of polar codes: Stopping sets, error floor, and concatenated design,\u201d IEEE Trans. Commun., vol.61, no.3, pp.919-929, March 2013. 10.1109\/tcomm.2013.012313.110692","DOI":"10.1109\/TCOMM.2013.012313.110692"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] X. Li, Q. Yu, Z. Shi, Y. Li, and Q. Yan, \u201cConcatenations of polar codes with outer nonbinary LDPC codes,\u201d Proc. 17th IEEE Int. Conf. Commun. Technol. (ICCT), pp.117-121, Oct. 2017. 10.1109\/icct.2017.8359615","DOI":"10.1109\/ICCT.2017.8359615"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] L. Ma and L. Zhang, \u201cParallel concatenated code combining polar code and LDPC code on AWGN channel,\u201d Proc. 15th Int. Conf. Anti-Counterfeiting, Secur. Identif. (ASID), pp.57-60, Oct. 2021. 10.1109\/asid52932.2021.9651728","DOI":"10.1109\/ASID52932.2021.9651728"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] H. Mahdavifar, M. El-Khamy, J. Lee, and I. Kang, \u201cPerformance limits and practical decoding of interleaved Reed-Solomon polar concatenated codes,\u201d IEEE Trans. Commun., vol.62, no.5, pp.1406-1417, May 2014. 10.1109\/tcomm.2014.050714.130602","DOI":"10.1109\/TCOMM.2014.050714.130602"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[8] Y. Wang, W. Zhang, Y. Liu, L. Wang, and Y. Liang, \u201cAn improved concatenation scheme of polar codes with Reed-Solomon codes,\u201d IEEE Commun. Lett., vol.21, no.3, pp.468-471, March 2017. 10.1109\/lcomm.2016.2639482","DOI":"10.1109\/LCOMM.2016.2639482"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] Q. Wang, P. Fu, and S. Zhang, \u201cA comparison of concatenated polar codes with different interleaving and decoding schemes,\u201d Proc. Int. Conf. Comput. Commun. Syst. (ICCCS), pp.570-574, May 2020. 10.1109\/icccs49078.2020.9118473","DOI":"10.1109\/ICCCS49078.2020.9118473"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[10] Y. Wang, L. Chen, C. Liu, and Z. Xing, \u201cAn improved concatenation scheme of BCH-polar codes with low-latency decoding architecture,\u201d IEEE Access, vol.7, pp.95867-95877, 2019. 10.1109\/access.2019.2929188","DOI":"10.1109\/ACCESS.2019.2929188"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] X. Xu, S. Wu, D. Dong, J. Jiao, and Q. Zhang, \u201cHigh performance short polar codes: A concatenation scheme using spinal codes as the outer code,\u201d IEEE Access, vol.6, pp.70644-70654, 2018. 10.1109\/access.2018.2879827","DOI":"10.1109\/ACCESS.2018.2879827"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] M. Moradi and A. Mozammel, \u201cConcatenated Reed-Solomon and polarization-adjusted convolutional (PAC) codes,\u201d Proc. IEEE Int. Black Sea Conf. Commun. Netw., pp.123-128, June 2022. 10.1109\/blackseacom54372.2022.9858284","DOI":"10.1109\/BlackSeaCom54372.2022.9858284"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[13] A. Balatsoukas-Stimming, M.B. Parizi, and A. Burg, \u201cLLR-based successive cancellation list decoding of polar codes,\u201d IEEE Trans. Signal Process., vol.63, no.19, pp.5165-5179, Oct. 2015. 10.1109\/tsp.2015.2439211","DOI":"10.1109\/TSP.2015.2439211"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[14] P. Trifonov, \u201cEfficient design and decoding of polar codes,\u201d IEEE Trans. Commun., vol.60, no.11, pp.3221-3227, Nov. 2012. 10.1109\/tcomm.2012.081512.110872","DOI":"10.1109\/TCOMM.2012.081512.110872"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] S.A. Hashemi, N. Doan, M. Mondelli and W.J. Gross, \u201cDecoding Reed-Muller and polar codes by successive factor graph permutations,\u201d Proc. IEEE 10th Int, Symp. Turbo Codes Iterative Inf. Process. (ISTC), pp.1-5, Dec. 2018. 10.1109\/istc.2018.8625281","DOI":"10.1109\/ISTC.2018.8625281"}],"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\/E108.A\/9\/E108.A_2024EAL2107\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T03:33:57Z","timestamp":1757129637000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E108.A\/9\/E108.A_2024EAL2107\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,1]]},"references-count":15,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2024eal2107","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"type":"print","value":"0916-8508"},{"type":"electronic","value":"1745-1337"}],"subject":[],"published":{"date-parts":[[2025,9,1]]},"article-number":"2024EAL2107"}}