A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
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 resultsarXiv:2110.07351v1 fatcat:f7a3idifr5e2notf7rxdd2xyjm