On depth spectra of constacyclic codes over finite commutative chain rings

12/12/2019
by   Anuradha Sharma, et al.
0

The depth of a sequence plays an important role in studying its linear complexity in game theory, communication theory and cryptography. In this paper, we determine depth spectra of all repeated-root (α+γβ)-constacyclic codes of arbitrary lengths over a finite commutative chain ring R, where α is a non-zero element of the Teichmüller set of R and β is a unit in R. We also illustrate our results with some examples.

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
05/23/2018

Duadic negacyclic codes over a finite non-chain ring and their Gray images

Let f(u) be a polynomial of degree m, m ≥ 2, which splits into distinct ...
research
01/30/2019

Do non-free LCD codes over finite commutative Frobenius rings exist?

In this paper, we clarify some aspects on LCD codes in the literature. W...
research
11/19/2018

On polycyclic codes over a finite chain ring

Galois images of polycyclic codes over a finite chain ring S and their a...
research
08/16/2019

Primitive Idempotents and Constacyclic Codes over Finite Chain Rings

Let R be a commutative local finite ring. In this paper, we construct th...
research
12/21/2018

MDS codes with Hermitian hulls of arbitrary dimensions and their quantum error correction

The Hermitian hull of linear codes plays an important role in coding the...
research
08/02/2018

Numerical Asymptotic Results in Game Theory Using Sergeyev's Infinity Computing

Prisoner's Dilemma (PD) is a widely studied game that plays an important...

Please sign up or login with your details

Forgot password? Click here to reset