A simplified criterion for MDP convolutional codes

03/16/2020
by   Gianira N. Alfarano, et al.
0

Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. There exists a well-known criterion to check whether a code is MDP using the parity-check matrix of the code. However, this criterion has only been shown under the assumption that the parity-check matrix is left prime. Proving left primeness of a polynomial matrix is not an easy task and also, in almost all the previous papers which provide a construction of MDP convolutional codes, there is a gap in the application of the mentioned criterion to show the MDP property, since it is not proven that the parity-check matrix is left prime. In this paper we close this gap. In particular, we show that under the assumption that (n-k)|δ or k|δ, a polynomial matrix that fulfills the MDP criterion is actually always left prime. Moreover, when (n-k)∤δ and k∤δ, we show that the MDP criterion is not enough to ensure left primeness. In this case, with one more assumption, we can guarantee the result.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2017

Complete MDP convolutional codes

Maximum distance profile (MDP) convolutional codes have the property tha...
research
04/19/2021

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

In this paper, we develop the theory of convolutional codes over finite ...
research
10/21/2022

Left ideal LRPC codes and a ROLLO-type cryptosystem based on group algebras

In this paper we introduce left ideal low-rank parity-check codes by usi...
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
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
04/13/2021

On Generalized Expanded Blaum-Roth Codes

Expanded Blaum-Roth (EBR) codes consist of n× n arrays such that lines o...
research
10/14/2020

On Factor Left Prime Factorization Problems for Multivariate Polynomial Matrices

This paper is concerned with factor left prime factorization problems fo...

Please sign up or login with your details

Forgot password? Click here to reset