12 research outputs found
Constacyclic Codes over Finite Fields
An equivalence relation called isometry is introduced to classify
constacyclic codes over a finite field; the polynomial generators of
constacyclic codes of length are characterized, where is the
characteristic of the finite field and is a prime different from
Reversible cyclic codes over finite chain rings
In this paper, necessary and sufficient conditions for the reversibility of a
cyclic code of arbitrary length over a finite commutative chain ring have been
derived. MDS reversible cyclic codes having length p^s over a finite chain ring
with nilpotency index 2 have been characterized and a few examples of MDS
reversible cyclic codes have been presented. Further, it is shown that the
torsion codes of a reversible cyclic code over a finite chain ring are
reversible. Also, an example of a non-reversible cyclic code for which all its
torsion codes are reversible has been presented to show that the converse of
this statement is not true. The cardinality and Hamming distance of a cyclic
code over a finite commutative chain ring have also been determined
Self-dual cyclic codes over finite chain rings
Let be a finite commutative chain ring with unique maximal ideal , and let be a positive integer coprime with the
characteristic of . In this paper, the algebraic
structure of cyclic codes of length over is investigated. Some new
necessary and sufficient conditions for the existence of nontrivial self-dual
cyclic codes are provided. An enumeration formula for the self-dual cyclic
codes is also studied.Comment: 15 page
Structure and Rank of Cyclic codes over a class of non-chain rings
The rings have been classified into chain rings and
non-chain rings on the basis of the values of In
this paper, the structure of cyclic codes of arbitrary length over the rings
for those values of for which these are non-chain
rings has been established. A unique form of generators of these codes has also
been obtained. Further, rank and cardinality of these codes have been
established by finding minimal spanning sets for these codes.Comment: 11 page