Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 17 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 96 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 455 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

On ZpZp[u, v]-additive cyclic and constacyclic codes (1905.06686v2)

Published 16 May 2019 in cs.IT and math.IT

Abstract: Let $\mathbb{Z}{p}$ be the ring of residue classes modulo a prime $p$. The $\mathbb{Z}{p}\mathbb{Z}{p}[u,v]$-additive cyclic codes of length $(\alpha,\beta)$ is identify as $\mathbb{Z}{p}[u,v][x]$-submodule of $\mathbb{Z}{p}[x]/\langle x{\alpha}-1\rangle \times \mathbb{Z}{p}[u,v][x]/\langle x{\beta}-1\rangle$ where $\mathbb{Z}{p}[u,v]=\mathbb{Z}{p}+u\mathbb{Z}{p}+v\mathbb{Z}{p}$ with $u{2}=v{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 $\mathbb{Z}{p}[u,v]$ and $\mathbb{Z}{p}\mathbb{Z}{p}[u,v]$-additive cyclic codes with length $(\alpha,\beta)$ respectively. We show that the Gray image of $\mathbb{Z}{p}\mathbb{Z}{p}[u,v]$-additive cyclic code with length $(\alpha,\beta)$ is either a QC code of length $4\alpha$ with index $4$ or a generalized QC code of length $(\alpha,3\beta)$ over $\mathbb{Z}{p}$. Moreover, some structural properties like generating polynomials, minimal generating sets of $\mathbb{Z}{p}\mathbb{Z}{p}[u,v]$-additive constacyclic code with length $(\alpha,p-1)$ are determined.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

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