# Dynamic-SCFlip Decoding of Polar Codes

## TL;DR

This paper introduces Dynamic-SCFlip decoding, a flexible method for polar codes that improves error correction by dynamically selecting bit-flips, achieving performance close to SC-List decoding with lower complexity.

## Contribution

The paper presents a novel Dynamic-SCFlip decoding algorithm that adaptively builds candidate flip lists, enhancing error correction while maintaining low complexity.

## Key findings

- D-SCFlip outperforms standard SC decoding in error correction.
- D-SCFlip achieves performance comparable to SC-List decoding.
- The method maintains low average computational complexity.

## Abstract

This paper proposes a generalization of the recently introduced Successive Cancellation Flip (SCFlip) decoding of polar codes, characterized by a number of extra decoding attempts, where one or several positions are flipped from the standard Successive Cancellation (SC) decoding. To make such an approach effective, we first introduce the concept of higher-order bit-flips, and propose a new metric to determine the bit-flips that are more likely to correct the trajectory of the SC decoding. We then propose a generalized SCFlip decoding algorithm, referred to as Dynamic-SCFlip (D-SCFlip), which dynamically builds a list of candidate bit-flips, while guaranteeing that extra decoding attempts are performed by decreasing probability of success. Simulation results show that D-SCFlip is an effective alternative to SC-List decoding of polar codes, by providing very good error correcting performance, with an average computation complexity close to the one of the SC decoder.