论文标题
高效解码极性代码，约16美元$ 16内核
Efficient decoding of polar codes with some 16$\times$16 kernels
论文作者
论文摘要
提出了一种二进制16 $ \ times $ 16核的解码算法，其极化速率为0.51828和缩放指数3.346和3.450。提出的方法利用了所考虑的内核和阿里坎矩阵的关系，以显着降低解码复杂性而不会造成任何性能损失。仿真结果表明，具有16 $ \ times $ 16内核的极性（子）代码与Arikan内核的表现可以优于极地代码，同时具有较低的解码复杂性。
A decoding algorithm for polar codes with binary 16$\times$16 kernels with polarization rate 0.51828 and scaling exponents 3.346 and 3.450 is presented. The proposed approach exploits the relationship of the considered kernels and the Arikan matrix to significantly reduce the decoding complexity without any performance loss. Simulation results show that polar (sub)codes with 16$\times$16 kernels can outperform polar codes with Arikan kernel, while having lower decoding complexity.
