Polar Codes with Dynamic Frozen Symbols and Their Decoding by Directed Search

TL;DR

This paper introduces a new polar code construction with dynamic frozen symbols, leveraging extended BCH codes for high minimum distance, and proposes a directed search decoding algorithm that improves efficiency by estimating error probabilities.

Contribution

The paper presents a novel polar code design with dynamic frozen symbols and a decoding method that reduces iterations through directed search based on error probability estimates.

Findings

Codes have high minimum distance due to BCH subcodes

Decoding algorithm reduces total iterations

Improved decoding efficiency demonstrated

Abstract

A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which employs estimates of the not-yet-processed bit channel error probabilities to perform directed search in code tree, reducing thus the total number of iterations.