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

Reports on Mathematical Physics

NEW QUANTUM CODES DERIVED FROM THE DIRECT PRODUCT OF RINGS, USING CYCLIC CODES OVER THE RING

Pooja Soni, Manju Pruthi, Arun Kumar Yadav

Published Apr 1, 2024• 0 citations
Publisher
DOI
10.1016/s0034-4877(24)00027-2

Related papers

New quantum codes from dual-containing cyclic codes over finite rings

Yongsheng Tang, Shixin Zhu, Xiaoshan Kai +1 more

arXiv:1608.06674•Quantum Information Processing•Aug 22, 2016•24 citations

NEW QUANTUM AND LCD CODES FROM CYCLIC CODES OVER A FINITE NON-CHAIN RING

Nadeem ur Rehman, Mohd Azmi, Ghulam Mohammad

Reports on Mathematical Physics•Apr 1, 2023•9 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

NONBINARY QUANTUM CODES DERIVED FROM REPEATED-ROOT CYCLIC CODES

Jianfa Qian, LINA ZHANG

Many good quantum error-correcting codes were constructed from cyclic codes. However, it is a difficult problem to determine the true minimum distance of quantum cyclic codes for large length n. In this work, we construct nonbinary quantum cyclic codes and asymmetric quantum cyclic codes that are derived from repeated-root cyclic codes for an arbitrary length ps, and determine the true minimum distance of all those codes. Some proposed quantum cyclic codes are optimal. Additionally, some proposed asymmetric quantum cyclic codes have better parameters than the ones available in the literature.

Modern Physics Letters B•Mar 4, 2013•7 citations

A study of quantum codes obtained from cyclic codes over a non-chain ring

Hai Quang Dinh, Narendra Kumar, Abhay Kumar Singh

Cryptography and Communications•Mar 8, 2022•3 citations

QUANTUM CODES FROM CYCLIC CODES OVER FINITE RING

Jianfa Qian, Wenping Ma, Wangmei Guo

A new method to obtain self-orthogonal codes over finite field F2 is presented. Based on this method, we provide a construction for quantum error-correcting codes starting from cyclic codes over finite ring R = F2 + uF2. As an example, we present infinite families of quantum error-correcting codes which are derived from cyclic codes over the ring R = F2 + uF2.

International Journal of Quantum Information•Sep 1, 2009•90 citations
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.
Many good quantum error-correcting codes were constructed from cyclic codes. However, it is a difficult problem to determine the true minimum distance of quantum cyclic codes for large length n. In this work, we construct nonbinary quantum cyclic codes and asymmetric quantum cyclic codes that are derived from repeated-root cyclic codes for an arbitrary length ps, and determine the true minimum distance of all those codes. Some proposed quantum cyclic codes are optimal. Additionally, some proposed asymmetric quantum cyclic codes have better parameters than the ones available in the literature.