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 be the ring of residue classes modulo a prime . The -additive cyclic codes of length is identify as -submodule of where with . In this article, we obtain the complete sets of generator polynomials, minimal generating sets for cyclic codes with length over and -additive cyclic codes with length respectively. We show that the Gray image of -additive cyclic code with length is either a QC code of length with index $4$ or a generalized QC code of length over . Moreover, some structural properties like generating polynomials, minimal generating sets of -additive constacyclic code with length are determined.
Paper Prompts
Sign up for free to create and run prompts on this paper.