Papers
Topics
Authors
Recent
Search
2000 character limit reached

On ZpZp[u, v]-additive cyclic and constacyclic codes

Published 16 May 2019 in cs.IT and math.IT | (1905.06686v2)

Abstract: Let Z<em>p\mathbb{Z}<em>{p} be the ring of residue classes modulo a prime pp. The Z</em>pZ<em>p[u,v]\mathbb{Z}</em>{p}\mathbb{Z}<em>{p}[u,v]-additive cyclic codes of length (α,β)(\alpha,\beta) is identify as Z</em>p[u,v][x]\mathbb{Z}</em>{p}[u,v][x]-submodule of Z<em>p[x]/⟨x<sup>α−1⟩</sup>×Z</em>p[u,v][x]/⟨x<sup>β−1⟩\mathbb{Z}<em>{p}[x]/\langle x<sup>{\alpha}-1\rangle</sup> \times \mathbb{Z}</em>{p}[u,v][x]/\langle x<sup>{\beta}-1\rangle where Z<em>p[u,v]=Z</em>p+uZ<em>p+vZ</em>p\mathbb{Z}<em>{p}[u,v]=\mathbb{Z}</em>{p}+u\mathbb{Z}<em>{p}+v\mathbb{Z}</em>{p} with u<sup>2=v<sup>2=uv=vu=0u<sup>{2}=v<sup>{2}=uv=vu=0. In this article, we obtain the complete sets of generator polynomials, minimal generating sets for cyclic codes with length β\beta over Z<em>p[u,v]\mathbb{Z}<em>{p}[u,v] and Z</em>pZ<em>p[u,v]\mathbb{Z}</em>{p}\mathbb{Z}<em>{p}[u,v]-additive cyclic codes with length (α,β)(\alpha,\beta) respectively. We show that the Gray image of Z</em>pZ<em>p[u,v]\mathbb{Z}</em>{p}\mathbb{Z}<em>{p}[u,v]-additive cyclic code with length (α,β)(\alpha,\beta) is either a QC code of length 4α4\alpha with index $4$ or a generalized QC code of length (α,3β)(\alpha,3\beta) over Z</em>p\mathbb{Z}</em>{p}. Moreover, some structural properties like generating polynomials, minimal generating sets of Z<em>pZ</em>p[u,v]\mathbb{Z}<em>{p}\mathbb{Z}</em>{p}[u,v]-additive constacyclic code with length (α,p−1)(\alpha,p-1) are determined.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.