Galois Correspondence on Linear Codes over Finite Chain Rings

Abstract

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…