Minimum Distance of PAC Codes v. Polar Codes Using Cyclic Shift Matrices

04/04/2023
by   Mohsen Moradi, et al.
Bilkent University
0

The polarization-adjusted convolutional (PAC) codes are a new family of linear codes that can perform close to the theoretical bounds. These codes make use of both polar coding and convolutional coding. In this study, by using the cyclic shift matrices, we provide new proof that, from the minimum distance viewpoint, PAC codes are superior to polar codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/10/2023

PAC Codes for Source and Joint Source-Channel Coding

Polarization-adjusted convolutional (PAC) codes, as a concatenated codin...
02/25/2022

Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) Codes

Polarization-adjusted convolutional (PAC) codes combine the polar and co...
06/16/2021

Concatenated Reed-Solomon and Polarization-Adjusted Convolutional (PAC) Codes

Two concatenated coding schemes incorporating algebraic Reed-Solomon (RS...
05/27/2020

List Decoding of Arikan's PAC Codes

Polar coding gives rise to the first explicit family of codes that prova...
01/21/2019

Vardøhus Codes: Polar Codes Based on Castle Curves Kernels

In this paper, we show some applications of algebraic curves to the cons...
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...
10/01/2022

CRISP: Curriculum based Sequential Neural Decoders for Polar Code Family

Polar codes are widely used state-of-the-art codes for reliable communic...

Please sign up or login with your details

Forgot password? Click here to reset