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

03/15/2020
by   Jinnan Piao, et al.
0

In this paper, the minimum weight distributions (MWDs) of polar codes and concatenated polar codes are exactly enumerated according to the distance property of codewords. We first propose a sphere constraint based enumeration method (SCEM) to analyze the MWD of polar codes with moderate complexity. The SCEM exploits the distance property that all the codewords with the identical Hamming weight are distributed on a spherical shell. Then, based on the SCEM and the Plotkin's construction of polar codes, a sphere constraint based recursive enumeration method (SCREM) is proposed to recursively calculate the MWD with a lower complexity. Finally, we propose a parity-check SCEM (PC-SCEM) to analyze the MWD of concatenated polar codes by introducing the parity-check equations of outer codes. Moreover, due to the distance property of codewords, the proposed three methods can exactly enumerate all the codewords belonging to the MWD. The enumeration results show that the SCREM can enumerate the MWD of polar codes with code length up to 2^14 and the PC-SCEM can be used to optimize CRC-polar concatenated codes.

READ FULL TEXT

page 3

page 4

page 5

page 6

page 7

page 8

page 10

page 11

research
12/13/2019

On Pre-transformed Polar Codes

In this paper, we prove that any pre-transformation with an upper-triang...
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 ...
research
05/04/2023

On the Closed-form Weight Enumeration of Polar Codes: 1.5d-weight Codewords

The weight distribution of error correction codes is a critical determin...
research
08/10/2023

An Efficient Construction Method Based on Partial Distance of Polar Codes with Reed-Solomon Kernel

Polar codes with Reed-Solomon (RS) kernel have great potential in next-g...
research
08/24/2020

Constructive Spherical Codes by Hopf Foliations

We present a new systematic approach to constructing spherical codes in ...
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...
research
02/15/2021

A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes

We present a deterministic algorithm for computing the entire weight dis...

Please sign up or login with your details

Forgot password? Click here to reset