5,855 research outputs found
On LCD, self dual and isodual cyclic codes over finite chain rings
Altres ajuts: Acord transformatiu CRUE-CSICIn this paper, LCD cyclic, self dual and isodual codes over finite chain rings are investigated. It was proven recently that a non-free LCD cyclic code does not exist over finite chain rings. Based on algebraic number theory, we introduce necessary and sufficient conditions for which all free cyclic codes over a finite chain ring are LCD. We have also obtained conditions on the existence of non trivial self dual cyclic codes of any length when the nilpotency index of the maximal ideal of a finite chain ring is even. Further, several constructions of isodual codes are given based on the factorization of the polynomial x−1 over a finite chain ring
Some Constacyclic Codes over Finite Chain Rings
For an -th power of a unit in a finite chain ring we prove that
-constacyclic repeated-root codes over some finite chain rings are
equivalent to cyclic codes. This allows us to simplify the structure of some
constacylic codes. We also study the -constacyclic codes of
length over the Galois ring
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
- …