混合核极化码的陪集码谱
On the Coset Weight Spectrum of Multi-Kernel Polar Codes
摘要: 极化码是信道编码领域的一项重大进展，通过高效的编码和解码算法实现了二进制输入离散记忆无失真信道(B-DMC)的对称容量。在极化码中，零陪集和一陪集之间的最小汉明距离以及重量谱与在第i个阶段的SCL解码中的路径度量惩罚密切相关。本文提出了一种概率方法，构造一个新的生成矩阵，这个生成矩阵是上三角的，并且上三角元素随机，一次来生成遍历全部陪集的一个码本，以此为基础，计算出了针对二阶核、三阶核和多核的陪集码谱的概率表达式。
Abstract: Polar codes are a significant advancement in the field of channel coding, achieving the symmetric capacity of binary-input discrete memoryless channels (B-DMC) through efficient encoding and decoding algorithms. In polar codes, the minimum Hamming distance between the zero and one cosets, as well as the weight spectrum, are closely related to the path metric in SCL decoding at the i-th stage. This study first demonstrates the relationship between the coset weight spectrum and the error probability of decoding, highlighting the importance of computing the coset weight spectrum.
文章引用：邢浩天, 杨卫华. 混合核极化码的陪集码谱[J]. 应用数学进展, 2024, 13(7): 3158-3169. https://doi.org/10.12677/aam.2024.137301

参考文献

[1] Arikan, E. (2009) Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels. IEEE Transactions on Information Theory, 55, 3051-3073. [Google Scholar] [CrossRef] 
[2] Niu, K. and Chen, K. (2012) CRC-Aided Decoding of Polar Codes. IEEE Communications Letters, 16, 1668-1671. [Google Scholar] [CrossRef] 
[3] Niu, K., Chen, K. and Lin, J. (2013) Beyond Turbo Codes: Rate-Compatible Punctured Polar Codes. 2013 IEEE International Conference on Communications (ICC), Budapest, 9-13 June 2013, 3423-3427. [Google Scholar] [CrossRef] 
[4] Wang, R. and Liu, R. (2014) A Novel Puncturing Scheme for Polar Codes. IEEE Communications Letters, 18, 2081-2084. [Google Scholar] [CrossRef] 
[5] Zhang, L., Zhang, Z., Wang, X., Yu, Q. and Chen, Y. (2014) On the Puncturing Patterns for Punctured Polar Codes. 2014 IEEE International Symposium on Information Theory, Honolulu, 29 June-4 July 2014, 121-125. [Google Scholar] [CrossRef] 
[6] Bioglio, V., Gabry, F. and Land, I. (2017) Low-Complexity Puncturing and Shortening of Polar Codes. 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), San Francisco, 19-22 March 2017, 1-6. [Google Scholar] [CrossRef] 
[7] Korada, S.B., Sasoglu, E. and Urbanke, R. (2010) Polar Codes: Characterization of Exponent, Bounds, and Constructions. IEEE Transactions on Information Theory, 56, 6253-6264. [Google Scholar] [CrossRef] 
[8] Gabry, F., Bioglio, V., Land, I. and Belfiore, J. (2017) Multi-Kernel Construction of Polar Codes. 2017 IEEE International Conference on Communications Workshops (ICC Workshops), Paris, 21-25 May 2017, 761-765. [Google Scholar] [CrossRef] 
[9] Tal, I. and Vardy, A. (2015) List Decoding of Polar Codes. IEEE Transactions on Information Theory, 61, 2213-2226. [Google Scholar] [CrossRef] 
[10] Niu, K., Li, Y. and Wu, W.L. (2019) Polar Codes: Analysis and Construction Based on Polar Spectrum.
[11] Valipour, M. and Yousefi, S. (2013) On Probabilistic Weight Distribution of Polar Codes. IEEE Communications Letters, 17, 2120-2123. [Google Scholar] [CrossRef] 
[12] Polyanskaya, R., Davletshin, M. and Polyanskii, N. (2020) Weight Distributions for Successive Cancellation Decoding of Polar Codes. IEEE Transactions on Communications, 68, 7328-7336. [Google Scholar] [CrossRef] 
[13] Li, Y., Zhang, H., Li, R., Wang, J., Yan, G. and Ma, Z. (2021). On the Weight Spectrum of Pre-Transformed Polar Codes. 2021 IEEE International Symposium on Information Theory (ISIT), Melbourne, 12-20 July 2021, 1224-1229.[CrossRef] 

为你推荐