  In this paper, we modify polar codes constructed with some 2^t x 2^t
polarization kernels to reduce the time complexity of the window decoding. This
modification is based on the permutation of the columns of the kernels. This
method is applied to some of the kernels constructed in the literature of size
16 and 32, with different error exponents and scaling exponents such as eNBCH
kernel. It is shown that this method reduces the complexity of the window
decoding significantly without affecting the performance.
