Convolutional codes over finite chain rings, MDP codes and their characterization

04/19/2021
by   Gianira N. Alfarano, et al.
0

In this paper, we develop the theory of convolutional codes over finite commutative chain rings. In particular, we focus on maximum distance profile (MDP) convolutional codes and we provide a characterization of these codes, generalizing the one known for fields. Moreover, we relate MDP convolutional codes over a finite chain ring with MDP convolutional codes over its residue field. Finally, we provide a construction of MDP convolutional codes over finite chain rings generalizing the notion of superregular matrices.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2020

Lifted Codes and Lattices from Codes Over Finite Chain Rings

In this paper we give the generalization of lifted codes over any finite...
research
12/21/2020

Weighted Reed-Solomon convolutional codes

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

A simplified criterion for MDP convolutional codes

Maximum distance profile (MDP) convolutional codes have the property tha...
research
08/09/2018

Necessary Field Size and Probability for MDP and Complete MDP Convolutional Codes

It has been shown that maximum distance profile (MDP) convolutional code...
research
06/17/2021

Density of Free Modules over Finite Chain Rings

In this paper we focus on modules over a finite chain ring ℛ of size q^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...
research
12/23/2017

Complete MDP convolutional codes

Maximum distance profile (MDP) convolutional codes have the property tha...

Please sign up or login with your details

Forgot password? Click here to reset