# A Randomized Construction of Polar Subcodes

## TL;DR

This paper introduces a randomized method for constructing polar subcodes that reduces low-weight codewords and enhances decoding performance, outperforming LDPC and turbo codes in simulations.

## Contribution

The paper presents a novel randomized construction technique for polar subcodes that improves error performance and reduces low-weight codewords compared to existing methods.

## Key findings

- Codes outperform LDPC and turbo codes in simulations
- Reduced number of low-weight codewords
- Improved decoding performance

## Abstract

A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are provided, which show that the obtained codes outperform LDPC and turbo codes.