Constacyclic Codes over Commutative Finite Principal Ideal Rings

05/20/2021
by   Yun Fan, et al.
0

For any constacyclic code over a finite commutative chain ring of length coprime to the characteristic of the ring, we construct explicitly generator polynomials and check polynomials, and exhibit a BCH bound for such constacyclic codes. As a consequence, such constacyclic codes are principal. Further, we get a necessary and sufficient condition that the cyclic codes over a finite commutative principal ideal ring are all principal. This condition is still sufficient for constacyclic codes over such rings being principal.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2023

An Algorithm to find the Generators of Multidimensional Cyclic Codes over a Finite Chain Ring

The aim of this paper is to determine the algebraic structure of multidi...
research
12/24/2020

Linear complementary pair of group codes over finite principal ideal rings

A pair (C, D) of group codes over group algebra R[G] is called a linear ...
research
04/02/2022

On the linear ℓ-intersection pair of codes over a finite principal ideal ring

Generalizing the linear complementary dual, the linear complementary pai...
research
11/24/2020

Non-Invertible-Element Constacyclic Codes over Finite PIRs

In this paper we introduce the notion of λ-constacyclic codes over finit...
research
11/27/2017

The Extension Theorem for Bi-invariant Weights over Frobenius Rings and Frobenius Bimodules

We give a sufficient condition for a bi-invariant weight on a Frobenius ...
research
01/27/2023

A comment on the structure of graded modules over graded principal ideal domains in the context of persistent homology

The literature in persistent homology often refers to a "structure theor...
research
03/20/2019

Some remarks on non projective Frobenius algebras and linear codes

With a small suitable modification, dropping the projectivity condition,...

Please sign up or login with your details

Forgot password? Click here to reset