The rate of polarization of the kernel depends only on its partial distances.
In this paper, we propose a search algorithm for polarization kernels with given partial distances. The proposed approach is based on depth-first search combined with some methods, which reduce the search space. This allows us to find polarization kernels of size \(17 \le l \le 27\)  (except \(l=24\) ) with better rate of polarization compared with the ones constructed in [1]}, [2]}.
