Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1810.11826 · Quantum Information and Computation

m-adic residue codes over F_q[v]/(v^s-v) and their applications to quantum codes

Ferhat Kürüz, Mustafa Sarı, Mehmet E. Köroğlu

Published Apr 1, 2022• 1 citation
arXivHTMLPDF

Abstract

Due to their rich algebraic structure, cyclic codes have a great deal of significance amongst linear codes. Duadic codes are the generalization of the quadratic residue codes, a special case of cyclic codes. The $m$-adic residue codes are the generalization of the duadic codes. The aim of this paper is to study the structure of the $m$-adic residue codes over the quotient ring $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$. We determine the idempotent generators of the $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$. We obtain some parameters of optimal $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$ with respect to Griesmer bound for rings. Furthermore, we derive a condition for $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$ to contain their dual. By making use of a preserving-orthogonality Gray map, we construct a family of quantum error correcting codes from the Gray images of dual-containing $m$-adic residue codes over $\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}$ and give some examples to illustrate our findings.

DOI
10.26421/qic22.5-6-4

Related papers

Self-orthogonal and quantum codes over chain rings

Maryam Bajalan, Mina Moeini, Bahattin Yıldız

In this paper, we investigate the Gray images of codes over chain rings, leading to the derivation of infinite families of self-orthogonal linear codes over the residue field $\mathbb{F}_q$. We determine the parameters of optimal self-orthogonal and divisible linear codes. Additionally, we study the Gray images of quasi-twisted codes, resulting in some self-orthogonal Griesmer quasi-cyclic codes. Finally, we employ the CSS construction to derive some quantum codes based on self-orthogonal linear codes. Received: 19 September 2023 | Accepted: 18 January 2024

Journal of Algebra Combinatorics Discrete Structures and Applications•May 6, 2024•0 citations

$(Θ, Δ_Θ, \mathbf{a})$-cyclic codes over $\mathbb{F}_q^l$ and their applications in the construction of quantum codes

Akanksha, Anuj Kumar Bhagat, Ritumoni Sarma

In this article, for a finite field $\mathbb{F}_q$ and a natural number $l,$ let $\mathcal{R}$ denote the product ring $\mathbb{F}_q^l.$ Firstly, for an automorphism $Θ$ of $\mathcal{R},$ a $Θ$-derivation $Δ_Θ$ of $\mathcal{R}$ and for a unit $\mathbf{a}$ in $\mathcal{R},$ we study $(Θ, Δ_Θ, \mathbf{a})$-cyclic codes over $\mathcal{R}.$ In this direction, we give an algebraic characterization of a $(Θ, Δ_Θ, \mathbf{a})$-cyclic code over $\mathcal{R}$, determine its generator polynomial, and find its decomposition over $\mathbb{F}_q.$ Secondly, we give a necessary and sufficient condition for a $(Θ, 0, \mathbf{a})$-cyclic code to be Euclidean dual-containing code over $\mathcal{R}.$ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $\mathbb{F}_q$ as Gray images of $(Θ, Δ_Θ, \mathbf{a})$-cyclic codes over $\mathcal{R}.$ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.

arXiv:2501.01708•Jan 3, 2025•0 citations

$ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $ -cyclic codes over $ \mathbb{F}_q^l $ and their application to construct quantum codes

Akanksha Tiwari, Anuj Kumar Bhagat, Ritumoni Sarma

In this article, for a finite field $ \mathbb{F}_q $ and a natural number $ l, $ let $ \mathcal{R} $ denote the product ring $ \mathbb{F}_q^l. $ Firstly, for an automorphism $ \Theta $ of $ \mathcal{R}, $ a $ \Theta $-derivation $ \Delta_\Theta $ of $ \mathcal{R} $ and for a unit $ \mathit{\boldsymbol{a}} $ in $ \mathcal{R}, $ we study $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ In this direction, we give an algebraic characterization of a $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic code over $ \mathcal{R} $, determine its generator polynomial, and find its decomposition over $ \mathbb{F}_q. $ Secondly, we give a necessary and sufficient condition for a $ (\Theta, 0, \mathit{\boldsymbol{a}}) $-cyclic code to be Euclidean dual-containing code over $ \mathcal{R}. $ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $ \mathbb{F}_q $ as Gray images of $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.

Advances in Mathematics of Communications•Jan 1, 2026•0 citations

On the Structure of Cyclic Codes Over $\mathbb{F}_{q}{RS}$ and Applications in Quantum and LCD Codes Constructions

Hai Quang Dinh, Tushar Bag, Ashish Kumar Upadhyay +2 more

Let p be an odd prime, q = pm, R = Fq+ uFqwith u2= 1, and S = Fq+ uFq+ vFq+ uvFqwith u2= 1, v2= 1, uv = vu. In this paper, FqRS-cyclic codes over FqRS are studied. As an application, we present a construction of quantum error-correcting codes (QECCs) from the FqRS-cyclic codes over FqRS, which provides new QECCs. We also consider linear complementary dual (LCD) codes from the FqRS-cyclic codes over FqRS. Among others, we construct a Gray map over FqRS and discuss the Gray images of FqRS-cyclic codes over Fq.

IEEE Access•Jan 1, 2020•36 citations

ON QUANTUM CODES FROM CYCLIC CODES OVER A CLASS OF NONCHAIN RINGS

Mustafa Sarı, İrfan Şiap

In this paper, we extend the results given in [3] to a nonchain ring $R_p={\mathbb{F}}_p+v{\mathbb{F}}_p+{\cdots}+v^{p-1}{\mathbb{F}}_p$ , where $v^p=v$ and p is a prime. We determine the structure of the cyclic codes of arbitrary length over the ring $R_p$ and study the structure of their duals. We classify cyclic codes containing their duals over $R_p$ by giving necessary and sufficient conditions. Further, by taking advantage of the Gray map ${\pi}$ defined in [4], we give the parameters of the quantum codes of length pn over ${\mathbb{F}}_p$ which are obtained from cyclic codes over $R_p$ . Finally, we illustrate the results by giving some examples.

Bulletin of the Korean Mathematical Society•Nov 30, 2016•25 citations

$\mathbb{F}_q\mathcal{R}$-skew cyclic codes and their application to quantum codes

Om Prakash, Shikha Patel, Habibul Islam

Let $p$ be a prime and $\mathbb{F}_q$ be the finite field of order $q=p^m$. In this paper, we study $\mathbb{F}_q\mathcal{R}$-skew cyclic codes where $\mathcal{R}=\mathbb{F}_q+u\mathbb{F}_q$ with $u^2=u$. To characterize $\mathbb{F}_q\mathcal{R}$-skew cyclic codes, we first establish their algebraic structure and then discuss the dual-containing properties by considering a non-degenerate inner product. Further, we define a Gray map over $\mathbb{F}_q\mathcal{R}$ and obtain their $\mathbb{F}_q$-Gray images. As an application, we apply the CSS (Calderbank-Shor-Steane) construction on Gray images of dual containing $\mathbb{F}_q\mathcal{R}$-skew cyclic codes and obtain many quantum codes with better parameters than the best-known codes available in the literature.

arXiv:2305.10404•May 17, 2023•0 citations
Due to their rich algebraic structure, cyclic codes have a great deal of significance amongst linear codes. Duadic codes are the generalization of the quadratic residue codes, a special case of cyclic codes. The mmm-adic residue codes are the generalization of the duadic codes. The aim of this paper is to study the structure of the mmm-adic residue codes over the quotient ring Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​. We determine the idempotent generators of the mmm-adic residue codes over Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​. We obtain some parameters of optimal mmm-adic residue codes over Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​ with respect to Griesmer bound for rings. Furthermore, we derive a condition for mmm-adic residue codes over Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​ to contain their dual. By making use of a preserving-orthogonality Gray map, we construct a family of quantum error correcting codes from the Gray images of dual-containing mmm-adic residue codes over Fq[v]⟨vs−v⟩\frac{{{\mathbb{F}_q}\left[ v \right]}}{{\left\langle {{v^s} - v} \right\rangle }}⟨vs−v⟩Fq​[v]​ and give some examples to illustrate our findings.
In this paper, we investigate the Gray images of codes over chain rings, leading to the derivation of infinite families of self-orthogonal linear codes over the residue field Fq\mathbb{F}_qFq​. We determine the parameters of optimal self-orthogonal and divisible linear codes. Additionally, we study the Gray images of quasi-twisted codes, resulting in some self-orthogonal Griesmer quasi-cyclic codes. Finally, we employ the CSS construction to derive some quantum codes based on self-orthogonal linear codes. Received: 19 September 2023 | Accepted: 18 January 2024
(Θ,ΔΘ,a)(Θ, Δ_Θ, \mathbf{a})(Θ,ΔΘ​,a)-cyclic codes over Fql\mathbb{F}_q^lFql​ and their applications in the construction of quantum codes
In this article, for a finite field Fq\mathbb{F}_qFq​ and a natural number l,l,l, let R\mathcal{R}R denote the product ring Fql.\mathbb{F}_q^l.Fql​. Firstly, for an automorphism ΘΘΘ of R,\mathcal{R},R, a ΘΘΘ-derivation ΔΘΔ_ΘΔΘ​ of R\mathcal{R}R and for a unit a\mathbf{a}a in R,\mathcal{R},R, we study (Θ,ΔΘ,a)(Θ, Δ_Θ, \mathbf{a})(Θ,ΔΘ​,a)-cyclic codes over R.\mathcal{R}.R. In this direction, we give an algebraic characterization of a (Θ,ΔΘ,a)(Θ, Δ_Θ, \mathbf{a})(Θ,ΔΘ​,a)-cyclic code over R\mathcal{R}R, determine its generator polynomial, and find its decomposition over Fq.\mathbb{F}_q.Fq​. Secondly, we give a necessary and sufficient condition for a (Θ,0,a)(Θ, 0, \mathbf{a})(Θ,0,a)-cyclic code to be Euclidean dual-containing code over R.\mathcal{R}.R. Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over Fq\mathbb{F}_qFq​ as Gray images of (Θ,ΔΘ,a)(Θ, Δ_Θ, \mathbf{a})(Θ,ΔΘ​,a)-cyclic codes over R.\mathcal{R}.R. Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.
In this article, for a finite field $ \mathbb{F}_q $ and a natural number $ l, $ let $ \mathcal{R} $ denote the product ring $ \mathbb{F}_q^l. $ Firstly, for an automorphism $ \Theta $ of $ \mathcal{R}, $ a $ \Theta $-derivation $ \Delta_\Theta $ of $ \mathcal{R} $ and for a unit $ \mathit{\boldsymbol{a}} $ in $ \mathcal{R}, $ we study $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ In this direction, we give an algebraic characterization of a $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic code over $ \mathcal{R} $, determine its generator polynomial, and find its decomposition over $ \mathbb{F}_q. $ Secondly, we give a necessary and sufficient condition for a $ (\Theta, 0, \mathit{\boldsymbol{a}}) $-cyclic code to be Euclidean dual-containing code over $ \mathcal{R}. $ Thirdly, we study Gray maps and obtain several MDS and optimal linear codes over $ \mathbb{F}_q $ as Gray images of $ (\Theta, \Delta_\Theta, \mathit{\boldsymbol{a}}) $-cyclic codes over $ \mathcal{R}. $ Moreover, we determine orthogonality preserving Gray maps and construct Euclidean dual-containing codes with good parameters. Lastly, as an application, we construct MDS and almost MDS quantum codes by employing the Euclidean dual-containing and annihilator dual-containing CSS constructions.
On the Structure of Cyclic Codes Over FqRS\mathbb{F}_{q}{RS}Fq​RS and Applications in Quantum and LCD Codes Constructions
Let p be an odd prime, q = pm, R = Fq+ uFqwith u2= 1, and S = Fq+ uFq+ vFq+ uvFqwith u2= 1, v2= 1, uv = vu. In this paper, FqRS-cyclic codes over FqRS are studied. As an application, we present a construction of quantum error-correcting codes (QECCs) from the FqRS-cyclic codes over FqRS, which provides new QECCs. We also consider linear complementary dual (LCD) codes from the FqRS-cyclic codes over FqRS. Among others, we construct a Gray map over FqRS and discuss the Gray images of FqRS-cyclic codes over Fq.
In this paper, we extend the results given in [3] to a nonchain ring Rp=Fp+vFp+⋯+vp−1FpR_p={\mathbb{F}}_p+v{\mathbb{F}}_p+{\cdots}+v^{p-1}{\mathbb{F}}_pRp​=Fp​+vFp​+⋯+vp−1Fp​ , where vp=vv^p=vvp=v and p is a prime. We determine the structure of the cyclic codes of arbitrary length over the ring RpR_pRp​ and study the structure of their duals. We classify cyclic codes containing their duals over RpR_pRp​ by giving necessary and sufficient conditions. Further, by taking advantage of the Gray map π{\pi}π defined in [4], we give the parameters of the quantum codes of length pn over Fp{\mathbb{F}}_pFp​ which are obtained from cyclic codes over RpR_pRp​ . Finally, we illustrate the results by giving some examples.
FqR\mathbb{F}_q\mathcal{R}Fq​R-skew cyclic codes and their application to quantum codes
Let ppp be a prime and Fq\mathbb{F}_qFq​ be the finite field of order q=pmq=p^mq=pm. In this paper, we study FqR\mathbb{F}_q\mathcal{R}Fq​R-skew cyclic codes where R=Fq+uFq\mathcal{R}=\mathbb{F}_q+u\mathbb{F}_qR=Fq​+uFq​ with u2=uu^2=uu2=u. To characterize FqR\mathbb{F}_q\mathcal{R}Fq​R-skew cyclic codes, we first establish their algebraic structure and then discuss the dual-containing properties by considering a non-degenerate inner product. Further, we define a Gray map over FqR\mathbb{F}_q\mathcal{R}Fq​R and obtain their Fq\mathbb{F}_qFq​-Gray images. As an application, we apply the CSS (Calderbank-Shor-Steane) construction on Gray images of dual containing FqR\mathbb{F}_q\mathcal{R}Fq​R-skew cyclic codes and obtain many quantum codes with better parameters than the best-known codes available in the literature.