# Permutation Decoding of Polar Codes

## TL;DR

This paper introduces a permutation decoding method for polar codes that achieves similar error correction performance to SCL decoders but with lower latency and without sorting operations.

## Contribution

It proposes a novel permutation decoding algorithm for polar codes that reduces complexity and latency compared to traditional SCL decoding.

## Key findings

- Error correction performance comparable to SCL decoders
- Reduced latency due to elimination of sorting operations
- New polar code construction improves performance under the proposed decoding

## Abstract

A new permutation decoding approach for polar codes is presented. The complexity of the algorithm is similar to that of a successive cancellation list (SCL) decoder, while it can be implemented with the latency of a successive cancellation decoder. As opposed to the SCL algorithm, the sorting operation is not used in the proposed method. It is shown that the error correction performance of the algorithm is similar to that of the SCL decoder for polar codes. Moreover, a new construction aiming to improve the error correction performance of polar codes under the proposed algorithm is presented.