English

Galois Correspondence on Linear Codes over Finite Chain Rings

Information Theory 2016-02-22 v2 math.IT

Abstract

Given SR\texttt{S}|\texttt{R} a finite Galois extension of finite chain rings and B\mathcal{B} an S\texttt{S}-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is Galois invariant if and only if the row standard form of its generator matrix has all entries in the fixed ring by the Galois group and show a Galois correspondence in the class of S\texttt{S}-linear codes. As applications some improvements of upper and lower bounds for the rank of the restriction and trace code are given and some applications to S\texttt{S}-linear cyclic codes are shown.

Keywords

Cite

@article{arxiv.1602.01242,
  title  = {Galois Correspondence on Linear Codes over Finite Chain Rings},
  author = {A. Fotue Tabue and E. Martínez-Moro and C. Mouaha},
  journal= {arXiv preprint arXiv:1602.01242},
  year   = {2016}
}