Emergent Mind

Construction of quantum codes from $(γ,Δ)$-cyclic codes

(2404.01904)
Published Apr 2, 2024 in cs.IT and math.IT

Abstract

Let $\mathbb{F}q$ be the finite field of $q=pm$ elements where $p$ is a prime and $m$ is a positive integer. This paper considers $(\gamma,\Delta)$-cyclic codes over a class of finite commutative non-chain rings $\mathscr{R}{q,s}=\mathbb{F}q[v1,v2,\dots,vs]/\langle vi-vi2,vivj=vjvi=0\rangle$ where $\gamma$ is an automorphism of $\mathscr{R}{q,s}$, $\Delta$ is a $\gamma$-derivation of $\mathscr{R}{q,s}$ and $1\leq i\neq j\leq s$ for a positive integer $s$. Here, we show that a $(\gamma,\Delta)$-cyclic code of length $n$ over $\mathscr{R}{q,s}$ is the direct sum of $(\theta,\Im)$-cyclic codes of length $n$ over $\mathbb{F}q$, where $\theta$ is an automorphism of $\mathbb{F}q$ and $\Im$ is a $\theta$-derivation of $\mathbb{F}q$. Further, necessary and sufficient conditions for both $(\gamma,\Delta)$-cyclic and $(\theta,\Im)$-cyclic codes to contain their Euclidean duals are established. Finally, we obtain many quantum codes by applying the dual containing criterion on the Gray images of these codes. The obtained codes have better parameters than those available in the literature.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.