Generalized column distances

12/23/2022
by   Elisa Gorla, et al.
0

We define a notion of r-generalized column distances for the j-truncation of a convolutional code. Taking the limit as j tends to infinity allows us to define r-generalized column distances of a convolutional code. We establish some properties of these invariants and compare them with other invariants of convolutional codes which appear in the literature.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/08/2023

Binary convolutional codes with optimal column distances

There exists a large literature of construction of convolutional codes w...
research
05/08/2023

Criteria for the construction of MDS convolutional codes with good column distances

Maximum-distance separable (MDS) convolutional codes are characterized b...
research
12/15/2021

Tensor Codes and their Invariants

In 1991, Roth introduced a natural generalization of rank metric codes, ...
research
04/14/2021

Noncatastrophic convolutional codes over a finite ring

Noncatastrophic encoders are an important class of polynomial generator ...
research
12/10/2018

Generalized Hamming weights of projective Reed--Muller-type codes over graphs

Let G be a connected graph and let X be the set of projective points def...
research
01/15/2022

Generalized weights of codes over rings and invariants of monomial ideals

We develop an algebraic theory of supports for R-linear codes of fixed l...
research
09/19/2019

A note on the quasiconvex Jensen divergences and the quasiconvex Bregman divergences derived thereof

We first introduce the class of quasiconvex and quasiconcave Jensen dive...

Please sign up or login with your details

Forgot password? Click here to reset