On the Lattice of Cyclic Linear Codes Over Finite Chain Rings

Abstract

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

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…