# A New Permutation Decoding Method for Reed-Muller Codes

## TL;DR

This paper introduces a new permutation decoding method for Reed-Muller codes that reduces decoding complexity through early termination techniques while maintaining error correction performance.

## Contribution

The paper presents a novel permutation decoding approach that leverages early termination to lower computational complexity without sacrificing accuracy.

## Key findings

- Decoding complexity is significantly reduced with early termination methods.
- Error correction performance remains comparable to existing recursive list decoders.
- The proposed method offers a practical improvement for Reed-Muller code decoding.

## Abstract

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.