  A novel permutation decoding method for Reed-Muller codes is presented. The
complexity and the error correction performance of the suggested permutation
decoding approach are similar to that of the recursive lists decoder. It is
demonstrated that the proposed decoding technique can take advantage of several
early termination methods leading to a significant reduction of the operations
number required for the decoding, with the error correction performance being
the same.
