Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constacyclic codes of length $4p^s$ over the Galois ring $GR(p^a,m)$

Published 8 Nov 2019 in cs.IT and math.IT | (1911.03089v2)

Abstract: For prime $p$, $GR(pa,m)$ represents the Galois ring of order $p{am}$ and characterise $p$, where $a$ is any positive integer. In this article, we study the Type (1) $\lambda$-constacyclic codes of length $4ps$ over the ring $GR(pa,m)$, where $\lambda=\xi_0+p\xi_1+p2z$, $\xi_0,\xi_1\in T(p,m)$ are nonzero elements and $z\in GR(pa,m)$. In first case, when $\lambda$ is a square, we show that any ideal of $\mathcal{R}_p(a,m,\lambda)=\frac{GR(pa,m)[x]}{\langle x{4ps}-\lambda\rangle}$ is the direct sum of the ideals of $\frac{GR(pa,m)[x]}{\langle x{2ps}-\delta\rangle}$ and $\frac{GR(pa,m)[x]}{\langle x{2ps}+\delta\rangle}$. In second, when $\lambda$ is not a square, we show that $\mathcal{R}_p(a,m,\lambda)$ is a chain ring whose ideals are $\langle (x4-\alpha)i\rangle\subseteq \mathcal{R}_p(a,m,\lambda)$, for $0\leq i\leq aps$ where $\alpha{ps}=\xi_0$. Also, we prove the dual of the above code is $\langle (x4-\alpha{-1}){aps-i}\rangle\subseteq \mathcal{R}_p(a,m,\lambda{-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) $\lambda$-constacyclic codes of length $4ps$ are obtained when $\lambda$ is not a square.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.