AI Chat AI Image Generator AI Video Text to Speech

On Pre-transformed Polar Codes

12/13/2019

∙

by Bin Li, et al.

∙

∙

In this paper, we prove that any pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and convolution code (CC) matrix) does not reduce the code minimum distance and an properly designed pre-transformation can reduce the number of codewords with the minimum distance. This explains that the pre-transformed polar codes can perform better than the Polar/RM codes.

Bin Li
210 publications
Huazi Zhang
24 publications
Jiaqi Gu
30 publications

page 1

page 2

page 3

research

∙ 04/15/2021

Performance of CRC Concatenated Pre-transformed RM-Polar Codes

In this paper, we discuss pre-transformed RM-Polar codes and cyclic redu...

0 Bin Li, et al. ∙

research

∙ 02/09/2022

Increasing the Minimum Distance of Polar-Like Codes with Pre-Transformation

Reed Muller (RM) codes are known for their good minimum distance. One ca...

0 Samet Gelincik, et al. ∙

research

∙ 03/15/2020

Sphere Constraint based Enumeration Methods to Analyze the Minimum Weight Distribution of Polar Codes

In this paper, the minimum weight distributions (MWDs) of polar codes an...

0 Jinnan Piao, et al. ∙

research

∙ 12/16/2019

CRC selection for decoding of CRC-polar concatenated codes

An efficient scheme to increase the performance of polar codes at short ...

0 Tsonka Baicheva, et al. ∙

research

∙ 04/18/2018

Stopping Redundancy Hierarchy Beyond the Minimum Distance

Stopping sets play a crucial role in failure events of iterative decoder...

0 Yauhen Yakimenka, et al. ∙

research

∙ 08/06/2023

Deep Polar Codes

In this paper, we introduce a novel class of pre-transformed polar codes...

0 Geon Choi, et al. ∙

research

∙ 01/05/2021

A New Formula for the Minimum Distance of an Expander Code

An expander code is a binary linear code whose parity-check matrix is th...

0 Sudipta Mallik, et al. ∙