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:1005.0879 · Advances in Mathematics of Communications

From skew-cyclic codes to asymmetric quantum codes

Martianus Frederic Ezerman, San Ling, Patrick Solé, Olfa Yemen

Published Jan 1, 2011• 20 citations
arXivHTMLPDF

Abstract

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.

DOI
10.3934/amc.2011.5.41

Related papers

Asymmetric quantum codes from skew cyclic codes over B1

Intan Muchtadi-Alamsyah, Irwansyah Irwansyah

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.

AIP conference proceedings•Jan 1, 2019•1 citation

Additive Asymmetric Quantum Codes

Martianus Frederic Ezerman, San Ling, Patrick Solé

We present a general construction of asymmetric quantum codes based on additive codes under the trace Hermitian inner product. Various families of additive codes over F4are used in the construction of many asymmetric quantum codes over F4.

arXiv:1002.4088•IEEE Transactions on Information Theory•Aug 1, 2011•65 citations

Additive conjucyclic codes over $ \mathbb{F}_{q^2} $: Trace correspondence and applications to quantum codes

Jingjie Lv, 廉贤, Ruihu Li +1 more

Additive conjucyclic codes over $ \mathbb{F}_{q^2} $ are closed under the conjugated cyclic shift and play an important role in constructing quantum error-correcting codes (QECCs). However, a systematic algebraic theory for such codes over general finite fields has been lacking. In this paper, we develop a unified framework by establishing a trace-based $ \mathbb{F}_q $-linear isomorphism between $ \mathbb{F}_{q^2}^n $ and $ \mathbb{F}_q^{2n} $. This correspondence shows that additive conjucyclic codes of length $ n $ correspond bijectively to $ q $-ary linear cyclic codes of length $ 2n $, translating their structural analysis to the well-understood setting of cyclic codes. Using this isomorphism, we determine the enumeration of such codes and give explicit forms of their generator matrices. We then introduce an alternating inner product on $ \mathbb{F}_{q^2}^n $, which is shown to be compatible with the symplectic inner product on $ \mathbb{F}_q^{2n} $ under the trace isomorphism. Based on this inner product, we characterize the dual-containing condition for additive conjucyclic codes and derive explicit parity-check matrices. Finally, we construct $ q $-ary QECCs from dual-containing additive conjucyclic codes. Our results unify and generalize previous studies on quaternary additive conjucyclic codes and present a construction method for $ q $-ary QECCs from additive conjucyclic codes, together with an illustrative example.

arXiv:2007.03963•AIMS Mathematics•Jan 1, 2026•3 citations

QUATERNARY CONSTRUCTION OF QUANTUM CODES FROM CYCLIC CODES OVER $\mathbb{F}_4 + u\mathbb{F}_4$

Xiaoshan Kai, Shixin Zhu

We give a construction for quantum codes from linear and cyclic codes over [Formula: see text]. We derive Hermitian self-orthogonal codes over [Formula: see text] as Gray images of linear and cyclic codes over [Formula: see text]. In particular, we use two binary codes associated with a cyclic code over [Formula: see text] of odd length to determine the parameters of the corresponding quantum code.

International Journal of Quantum Information•Mar 1, 2011•81 citations

A construction method for a family of quantum cyclic codes

Xinmei Wang

The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding classical self-orthogonal linear codes over the Galois field GF(4) under a Hermitian inner product.A classical cyclic code over the field GF(4) is self-orthogonal with respect to the Hermitian inner product iff the generator polynomial of its dual code is a factor of its generator polynomial.Based on this connection,a class of quantum cyclic codes is constructed by finding corresponding classical cyclic codes.Some examples are also given in detail.

Journal of Xidian University•Jan 1, 2007•0 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
We introduce an additive but not F\mathbb FF4-linear map SSS from F\mathbb FF4nto F\mathbb FF42n and exhibit some of its interestingstructural properties. If CCC is a linear [n,k,d][n,k,d][n,k,d]4-code, thenS(C)S(C)S(C) is an additive (2n,2(2n,2(2n,22k,2d)2d)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)(n,M,d)(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.
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.
Additive conjucyclic codes over $ \mathbb{F}_{q^2} $ are closed under the conjugated cyclic shift and play an important role in constructing quantum error-correcting codes (QECCs). However, a systematic algebraic theory for such codes over general finite fields has been lacking. In this paper, we develop a unified framework by establishing a trace-based $ \mathbb{F}_q $-linear isomorphism between $ \mathbb{F}_{q^2}^n $ and $ \mathbb{F}_q^{2n} $. This correspondence shows that additive conjucyclic codes of length $ n $ correspond bijectively to $ q $-ary linear cyclic codes of length $ 2n $, translating their structural analysis to the well-understood setting of cyclic codes. Using this isomorphism, we determine the enumeration of such codes and give explicit forms of their generator matrices. We then introduce an alternating inner product on $ \mathbb{F}_{q^2}^n $, which is shown to be compatible with the symplectic inner product on $ \mathbb{F}_q^{2n} $ under the trace isomorphism. Based on this inner product, we characterize the dual-containing condition for additive conjucyclic codes and derive explicit parity-check matrices. Finally, we construct $ q $-ary QECCs from dual-containing additive conjucyclic codes. Our results unify and generalize previous studies on quaternary additive conjucyclic codes and present a construction method for $ q $-ary QECCs from additive conjucyclic codes, together with an illustrative example.
QUATERNARY CONSTRUCTION OF QUANTUM CODES FROM CYCLIC CODES OVER F4+uF4\mathbb{F}_4 + u\mathbb{F}_4F4​+uF4​
The problem of finding stabilizer quantum-error-correcting codes can be transformed into the problem of finding classical self-orthogonal linear codes over the Galois field GF(4) under a Hermitian inner product.A classical cyclic code over the field GF(4) is self-orthogonal with respect to the Hermitian inner product iff the generator polynomial of its dual code is a factor of its generator polynomial.Based on this connection,a class of quantum cyclic codes is constructed by finding corresponding classical cyclic codes.Some examples are also given in detail.
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.