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

AIP conference proceedings

Asymmetric quantum codes from skew cyclic codes over B1

Intan Muchtadi-Alamsyah, Irwansyah Irwansyah

Published Jan 1, 2019• 1 citation
Publisher

Abstract

Skew cyclic codes over Bk = 𝔽pr [v1, …, vk]/〈vi2 − vi, vivj – vjvi〉 have been studied by Irwansyah et al in 2018. In this paper we use B1 = 𝔽p2 [v]/〈v2 – v〉 and the Gray map φ : B1→𝔽p22 defined by φ(a + bv) = (a, a + b) for all a + bv ∈ B1 and extend φ to Φ : B1n→𝔽p22n. If C is a skew cyclic code over B1, we can get Φ(C) ⊆ 𝔽p22n a skew cyclic code if n is odd and a skew 2-quasicyclic code if n is even. Then by using the map S introduced by Ezerman et al in 2011, we get a (4n, p2k, 2d) additive code over 𝔽p2 and we use this to construct an additive asymmetric quantum code.

DOI
10.1063/1.5139134

Related papers

From skew-cyclic codes to asymmetric quantum codes

Martianus Frederic Ezerman, San Ling, Patrick Solé +1 more

We introduce an additive but not $\mathbb F$4-linear map $S$ from $\mathbb F$4nto $\mathbb F$42n and exhibit some of its interestingstructural properties. If $C$ is a linear $[n,k,d]$4-code, then$S(C)$ is an additive $(2n,2$2k,$2d)$4-code. If $C$ is an additivecyclic code then $S(C)$ is an additive quasi-cyclic code of index $2$.Moreover, if $C$ is a module $\theta$-cyclic code, a recentlyintroduced type of code which will be explained below, then $S(C)$ isequivalent to an additive cyclic code if $n$ is odd andto an additive quasi-cyclic code of index $2$ if $n$ is even.Given any $(n,M,d)$4-code $C$, the code $S(C)$ isself-orthogonal under the trace Hermitian inner product. Sincethe mapping $S$ preserves nestedness, it can be used as a toolin constructing additive asymmetric quantum codes.

arXiv:1005.0879•Advances in Mathematics of Communications•Jan 1, 2011•20 citations

Quantum codes from skew constacyclic codes over Fp m + vFp m + v2Fp m

Ram Krishna Verma, Om Prakash, Ashutosh Singh

For an odd prime p and m ≥ 1, let R = Fpm[v]/{v3} = v}. Here our aim is to construct new non-binary quantum codes from skew constacyclic codes over this non-chain ring ℛ. In order to achieve our goal, first we study the structural properties of skew constacyclic codes and their Euclidean duals over the ring ℛ. Then we determine a necessary and sufficient condition for these codes to contain their Euclidean duals. Finally, by applying CSS construction on these dual containing skew constacyclic codes and using Gray map, we obtain several new quantum codes.

International Workshop Algebraic and Combinatorial Coding Theory•Oct 11, 2020•5 citations

New Non-binary Quantum Codes Over Fq+uFq+vFq+uvFq

Leilei Gao

Let R= Fq+uFq+vFq+uvFq be a commutative ring with u2=u, v2=v, uv=vu, where q is a power of an odd prime. Ashraf and Mohammad constructed some new quantum codes from cyclic codes. Under this background, another Gray map from R to Fq4 is given. This map can be naturally extended to Rn. The problem on the ring turns to the field by this isomorphic map now. Therefore, This mapping is obviously a weight-preserving and distance-preserving map. The results show that the codes after mapping are self-orthogonal codes over Fq if they are self-orthogonal codes over R. Some computational examples show that some better non-binary quantum codes can be obtained under this Gray map. We discuss the structure of linear codes. On this basis, the structure of the generating matrix of linear codes is obtained. The structure of their dual codes is also obtained. The CSS construction guarantees the existence of quantum codes. Finally, with the help of the CSS construction, we get some good quantum codes. By comparison, our quantum codes have better parameters.

International Journal of Discrete Mathematics•Jan 1, 2019•0 citations

QUANTUM CODES FROM CYCLIC CODES OVER F4+ vF4

Mehmet Özen, FAIK CEM ERTUNC, Halit İnce

In this work, a method is given to construct quantum codes from cyclic codes over F4 + vF4 which will be denoted as R throughout the paper, where v2 = v and a Gray map is defined between R and where F4 is the field with 4 elements. Some optimal quantum code parameters and others will be presented at the end of the paper.

Journal of applied mathematics & informatics•Sep 30, 2016•1 citation

New non-binary quantum codes from skew constacyclic codes over the ring F p m +v{F p m +v 2 F p m .

Ram Krishna Verma, Om Prakash, Ashutosh Kumar Singh

In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring $\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangle$ where $p$ is an odd prime and $m \geq 1$. In order to obtain such quantum codes, first we study the structural properties of skew constacyclic codes and their Euclidean duals over the ring $\mathcal{R}$. Then a necessary and sufficient condition for skew constacyclic codes over $\mathcal{R}$ to contain their Euclidean duals is established. Finally, with the help of CSS construction and using Gray map, many new non-binary quantum codes are obtained over $\mathbb{F}_{p^m}$.

•Jan 1, 2020•0 citations

Optimal quantum codes from additive skew cyclic codes

Nuh Aydın, Taher Abualrub

Additive codes received much attention due to their connections with quantum codes. On the other hand, skew cyclic codes proved to be a useful class of codes that contain many good codes. In this work, we introduce and study additive skew cyclic codes over the quaternary field [Formula: see text], obtaining some structural properties of these codes. Moreover, we also show that many best known and optimal quantum codes can be obtained from this class.

Discrete Mathematics Algorithms and Applications•Mar 30, 2016•14 citations
Skew cyclic codes over Bk = 𝔽pr [v1, …, vk]/〈vi2 − vi, vivj – vjvi〉 have been studied by Irwansyah et al in 2018. In this paper we use B1 = 𝔽p2 [v]/〈v2 – v〉 and the Gray map φ : B1→𝔽p22 defined by φ(a + bv) = (a, a + b) for all a + bv ∈ B1 and extend φ to Φ : B1n→𝔽p22n. If C is a skew cyclic code over B1, we can get Φ(C) ⊆ 𝔽p22n a skew cyclic code if n is odd and a skew 2-quasicyclic code if n is even. Then by using the map S introduced by Ezerman et al in 2011, we get a (4n, p2k, 2d) additive code over 𝔽p2 and we use this to construct an additive asymmetric quantum code.
We introduce an additive but not $\mathbb F$4-linear map SSS from $\mathbb F$4nto $\mathbb F$42n and exhibit some of its interestingstructural properties. If CCC is a linear $[n,k,d]4−code,then4-code, then4−code,thenS(C)$ is an additive $(2n,2$2k,$2d)$4-code. If CCC is an additivecyclic code then S(C)S(C)S(C) is an additive quasi-cyclic code of index 222.Moreover, if CCC is a module θ\thetaθ-cyclic code, a recentlyintroduced type of code which will be explained below, then S(C)S(C)S(C) isequivalent to an additive cyclic code if nnn is odd andto an additive quasi-cyclic code of index 222 if nnn is even.Given any $(n,M,d)$4-code CCC, the code S(C)S(C)S(C) isself-orthogonal under the trace Hermitian inner product. Sincethe mapping SSS preserves nestedness, it can be used as a toolin constructing additive asymmetric quantum codes.
For an odd prime p and m ≥ 1, let R = Fpm[v]/{v3} = v}. Here our aim is to construct new non-binary quantum codes from skew constacyclic codes over this non-chain ring ℛ. In order to achieve our goal, first we study the structural properties of skew constacyclic codes and their Euclidean duals over the ring ℛ. Then we determine a necessary and sufficient condition for these codes to contain their Euclidean duals. Finally, by applying CSS construction on these dual containing skew constacyclic codes and using Gray map, we obtain several new quantum codes.
Let R= Fq+uFq+vFq+uvFq be a commutative ring with u2=u, v2=v, uv=vu, where q is a power of an odd prime. Ashraf and Mohammad constructed some new quantum codes from cyclic codes. Under this background, another Gray map from R to Fq4 is given. This map can be naturally extended to Rn. The problem on the ring turns to the field by this isomorphic map now. Therefore, This mapping is obviously a weight-preserving and distance-preserving map. The results show that the codes after mapping are self-orthogonal codes over Fq if they are self-orthogonal codes over R. Some computational examples show that some better non-binary quantum codes can be obtained under this Gray map. We discuss the structure of linear codes. On this basis, the structure of the generating matrix of linear codes is obtained. The structure of their dual codes is also obtained. The CSS construction guarantees the existence of quantum codes. Finally, with the help of the CSS construction, we get some good quantum codes. By comparison, our quantum codes have better parameters.
In this article, we construct new non-binary quantum codes from skew constacyclic codes over finite commutative non-chain ring R=Fpm[v]/⟨v3=v⟩\mathcal{R}= \mathbb{F}_{p^m}[v]/\langle v^3 =v \rangleR=Fpm​[v]/⟨v3=v⟩ where ppp is an odd prime and m≥1m \geq 1m≥1. In order to obtain such quantum codes, first we study the structural properties of skew constacyclic codes and their Euclidean duals over the ring R\mathcal{R}R. Then a necessary and sufficient condition for skew constacyclic codes over R\mathcal{R}R to contain their Euclidean duals is established. Finally, with the help of CSS construction and using Gray map, many new non-binary quantum codes are obtained over Fpm\mathbb{F}_{p^m}Fpm​.