Two-dimensional constacyclic codes over finite chain rings
Abstract
The main focus of this paper is on the algebraic structure of two-dimensional (λ,μ)-constacyclic codes of length over finite chain rings with residue field Fq, where q 1 rm and r denotes the multiplicative order of μ. In this paper, the structure of two-dimensional (λ,μ)-constacyclic codes is obtained. Our approach relies on analysing primitive idempotents within the finite chain ring to determine the generators of these codes. We also find the condition under which two-dimensional constacyclic codes are maximum Hamming distance with respect to rank (MHDR) over finite chain rings.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.