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

01/21/2019
by   Eduardo Camps, et al.
0

In this paper, we show some applications of algebraic curves to the construction of kernels of polar codes over a discrete memoryless channel which is symmetric w.r.t the field operations. We will also study the minimum distance of the polar codes proposed, their duals and the exponents of the matrices used for defining them. All the restrictions that we make to our curves will be accomplished by the so-called Castle Curves.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2020

Efficient decoding of polar codes with some 16×16 kernels

A decoding algorithm for polar codes with binary 16×16 kernels with pola...
research
02/02/2020

Polar decreasing monomial-Cartesian codes

We prove that families of polar codes with multiple kernels over certain...
research
10/23/2022

Computing the minimum distance of the C(𝕆_3,6) polar Orthogonal Grassmann code with elementary methods

The polar orthogonal Grassmann code C(𝕆_3,6) is the linear code associat...
research
07/19/2021

On a Class of Polar Log-Aesthetic Curves

Curves are essential concepts that enable compounded aesthetic curves, e...
research
10/14/2021

Shortened Polarization Kernels

A shortening method for large polarization kernels is presented, which r...
research
01/11/2020

Partially symmetric monomial codes

A framework of monomial codes is considered, which includes linear codes...
research
04/04/2023

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

The polarization-adjusted convolutional (PAC) codes are a new family of ...

Please sign up or login with your details

Forgot password? Click here to reset