A shortening method for large polarization kernels is presented, which results in shortened kernels with the highest error exponent if applied to kernels of size up to 32. It uses lower and upper bounds on partial distances for quick elimination of unsuitable shortening patterns. The proposed algorithm is applied to some kernels of sizes 16 and 32 to obtain shortened kernels of sizes from 9 to 31. These kernels are used in mixed-kernel polar codes of various lengths. Numerical results demonstrate the advantage of polar codes with shortened large kernels compared with shortened and punctured Arikan polar codes, and polar codes with small kernels.

翻译：对大型两极内核采用一种缩短方法,其结果是缩短了内核,如果对体积达到32度的内核应用出最高误差,则使用部分距离的下限和上界,以迅速消除不适当的缩短式样;提议的算法适用于一些大小为16和32的内核,以获得从9到31的缩短型号内核;这些内核用于不同长度的混合内核极代码;数字结果表明极地码的优点是,与缩短和刺穿的亚里坎极地码相比,极地码缩短了大内核,而极地码则与缩短和刺穿的亚里坎极地码比较,极地码则与小内核比较。