关于Polar码重量谱的一个验证  

A Verification of Polar Code Weight Spectrum

作　　者：乔玉洁 杨卫华 

机构地区：[1]太原理工大学,数学学院,山西 晋中

出　　处：《应用数学进展》2022年第3期956-965,共10页Advances in Applied Mathematics

摘　　要：Polar码的优势和局限性都在于其严格的结构。Polar码常用的信息位选择方式为根据串行抵消(SC)译码算法中的信道可靠度进行选择,但是这样的选择方法不适用所有的情况。在基于SC译码算法的基础上改进的列表(SCL)译码算法中,选择信息位需要考虑码重量谱和可靠度,得到的性能较好。目前,已经有很多通过改善码谱进而改善性能的方法了。为了去寻找一种通用的改善码谱的方法,我们需要刻画原码重量谱的分布规则,探索在不同情形下选择信息位的方法。在本文中,提出了一种新的行表示方法,在此基础上验证了码谱唯一的信息集的数量范围,引入容斥原理推出二元域下码重的通用公式。The advantages and disadvantages of Polar codes lie in its strict structure. At present, the existing information set selection method is based on the reliability of Successive Cancellation (SC) decoding algorithm, which may not be suitable for other algorithms. Improved SCL (SC List) decoding based on SC decoding needs to consider reliability and code weight spectrum. Various methods to improve the spectrum have been proposed and achieved better performance. In order to find a good way to improve the spectrum, we characterize the distribution law of weight spectrum and try to find suitable information set selection methods in different situations. In this paper, a new row representation method is proposed. On this basis, the number range of the information set of the unique code spectrum is verified, and the general formula of code weight in the binary field is derived by introducing the principle of tolerance and exclusion.

关 键 词：Polar码 RM码 码重量谱 信息集 容斥原理 

分 类 号：O29[理学—应用数学]