pith. sign in

arxiv: 1602.01242 · v2 · pith:CB2FI2HAnew · submitted 2016-02-03 · 💻 cs.IT · math.IT

Galois Correspondence on Linear Codes over Finite Chain Rings

classification 💻 cs.IT math.IT
keywords galoislineartextttcodecodesfiniteapplicationschain
0
0 comments X
read the original abstract

Given $\texttt{S}|\texttt{R}$ a finite Galois extension of finite chain rings and $\mathcal{B}$ an $\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 $\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 $\texttt{S}$-linear cyclic codes are shown.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.