English

On the Lattice of Cyclic Linear Codes Over Finite Chain Rings

Information Theory 2017-02-06 v1 math.IT Rings and Algebras

Abstract

Let R\texttt{R} be a commutative finite chain ring of invariants (q,s).(q,s). In this paper, the trace representation of any free cyclic R\texttt{R}-linear code of length ,\ell, is presented, via the qq-cyclotomic cosets modulo ,\ell, when gcd(,q)=1.\texttt{gcd}(\ell, q) = 1. The lattice (Cy(R,),+,)\left(\texttt{Cy}(\texttt{R},\ell), +, \cap\right) of cyclic R\texttt{R}-linear codes of length ,\ell, is investigated. A lower bound on the Hamming distance of cyclic R\texttt{R}-linear codes of length ,\ell, is established. When qq is even, a family of MDS and self-orthogonal R\texttt{R}-linear cyclic codes, is constructed.

Keywords

Cite

@article{arxiv.1701.08740,
  title  = {On the Lattice of Cyclic Linear Codes Over Finite Chain Rings},
  author = {Alexandre Fotue Tabue and Christophe Mouaha},
  journal= {arXiv preprint arXiv:1701.08740},
  year   = {2017}
}

Comments

arXiv admin note: substantial text overlap with arXiv:1701.08736