Reduced Complexity Decoding of Polar Codes with Reed-Solomon Kernel

We propose to reduce the decoding complexity of polar codes with Reed-Solomon kernels by exploiting its algebraic similarity with Arikan kernel, and employing the stack algorithm for computing the probabilities of kernel input symbols. Simulation results show that polar codes with 8 × 8 Reed-Solomon kernel under SC decoding provide performance comparable to Arikan polar codes with CRC under list SC decoding.