Convolutional codes with a maximum distance profile based on skew polynomials

12/08/2021
by   Zitan Chen, et al.
0

We construct a family of (n,k) convolutional codes with degree δin k,n-k that have a maximum distance profile. The field size required for our construction is of the order n^2δ, which improves upon the known constructions of convolutional codes with a maximum distance profile. Our construction is based on the theory of skew polynomials.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/15/2023

A lower bound on the field size of convolutional codes with a maximum distance profile and an improved construction

Convolutional codes with a maximum distance profile attain the largest p...
research
10/27/2022

Convolutional Codes with Optimum Bidirectional Distance Profile

In this paper we present tables of convolutional codes with an optimum b...
research
12/21/2020

Weighted Reed-Solomon convolutional codes

In this paper we present a concrete algebraic construction of a novel cl...
research
01/22/2020

Convolutional Codes

The article provides a survey on convolutional codes stressing the conne...
research
05/09/2023

On the Minimum Distance of Subspace Codes Generated by Linear Cellular Automata

Motivated by applications to noncoherent network coding, we study subspa...
research
12/05/2017

State spaces of convolutional codes, codings and encoders

In this paper we give a compact presentation of the theory of abstract s...
research
11/30/2019

Constructions of (2, 1, 2) complete j-MDP convolutional codes

Maximum distance profile (MDP) convolutional codes have been proven to b...

Please sign up or login with your details

Forgot password? Click here to reset