Constacyclic codes of length 4ps over the Galois ring GR(pa,m)
Abstract
For prime p, GR(pa,m) represents the Galois ring of order pam and characterise p, where a is any positive integer. In this article, we study the Type (1) λ-constacyclic codes of length 4ps over the ring GR(pa,m), where λ=0+p1+p2z, 0,1∈ T(p,m) are nonzero elements and z∈ GR(pa,m). In first case, when λ is a square, we show that any ideal of Rp(a,m,λ)=GR(pa,m)[x] x4ps-λ is the direct sum of the ideals of GR(pa,m)[x] x2ps-δ and GR(pa,m)[x] x2ps+δ. In second, when λ is not a square, we show that Rp(a,m,λ) is a chain ring whose ideals are (x4-α)i⊂eq Rp(a,m,λ), for 0≤ i≤ aps where αps=0. Also, we prove the dual of the above code is (x4-α-1)aps-i⊂eq Rp(a,m,λ-1) and present the necessary and sufficient condition for these codes to be self-orthogonal and self-dual, respectively. Moreover, the Rosenbloom-Tsfasman (RT) distance, Hamming distance and weight distribution of Type (1) λ-constacyclic codes of length 4ps are obtained when λ is not a square.
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.