A new search method for large polarization kernels is proposed. The algorithm produces a kernel with given partial distances by employing depth-first search combined with some methods which reduce the search space. Using the proposed method, we improved almost all existing lower bounds on the maximum rate of polarization for kernels of size from 17 to 27. We also obtained kernels which admit low complexity processing by the recently proposed recursive trellis algorithm. Numerical results demonstrate the advantage of polar codes with the proposed kernels compared with shortened polar codes and polar codes with small kernels.

翻译：提出了一个新的大型极化内核搜索方法。 算法通过采用深度第一搜索和一些缩小搜索空间的方法,产生了一个有部分距离的内核。 使用拟议方法,我们几乎改进了现有所有关于大小内核最大极化率的较低界限,从17个提高到27个。 我们还获得了一些内核,这些内核承认最近提议的递转电流算法对低复杂程度的处理。 数字结果显示,拟议的内核极分码与缩短的极地码和小内核极码相比,具有优势。