Successive cancellation decoding of Reed–Solomon codes

A novel soft-decision decoding algorithm for Reed-Solomon codes over $GF(2^m)$ is proposed, which is based on representing them as polar codes with dynamic frozen symbols and applying the successive cancellation method. A further performance improvement is obtained by exploiting multiple permutations of codewords which are taken from the automorphism group of Reed–Muller codes. It is also shown that the proposed algorithm can be simplified in the case of decoding a binary image of the Reed–Solomon code.