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

International Computer Conference on Wavelet Active Media Technology and Information Processing (ICCWAMTIP)

Quantum subsystem codes drived from negacyclic codes

Jian‐Zhang Chen, Jianping Li, Jie Lin, Yuanyuan Huang

Published Dec 1, 2014• 2 citations
Publisher

Abstract

In this paper, we utilize negacyclic codes to construct a family of optimal subsystem codes with parameters [[q2+1,(q-1)2, 4, q-1]]q> where q = 1(mod4), q = pτ, τ ≥ 1 and p is an odd prime. These constructed quantum subsystem codes are different from those codes available in the literature.
DOI
10.1109/iccwamtip.2014.7073373

Related papers

New optimal asymmetric quantum codes from constacyclic codes

Guanghui Zhang, Bocong Chen, Liangchen Li

In this paper, we construct two classes of asymmetric quantum codes by using constacyclic codes. The first class is the asymmetric quantum codes with parameters [[q2 + 1, q2 + 1 - 2(t + k + 1), (2k + 2)/(2t + 2)]]q2 where q is an odd prime power, t, k are integers with [Formula: see text], which is a generalization of [J. Chen, J. Li and J. Lin, Int. J. Theor. Phys. 53 (2014) 72, Theorem 2] in the sense that we do not assume that q ≡1 ( mod 4). The second one is the asymmetric quantum codes with parameters [Formula: see text], where q ≥ 5 is an odd prime power, t, k are integers with 0 ≤ t ≤ k ≤ q - 1. The constructed asymmetric quantum codes are optimal and their parameters are not covered by the codes available in the literature.

Modern Physics Letters B•Jun 17, 2014•14 citations

New Quantum MDS Codes From Negacyclic Codes

Xiaoshan Kai, Shixin Zhu

Letqbe an odd prime power. Based on classical negacyclic codes, we construct two classes of quantum maximum-distance-separable (MDS) codes with parameters [[q2+1,q2-2d+3,d]]qwhereq≡ 1 (mod 4) and 2 ≤d≤q+1 is even, and [[(q2+1)/2,(q2+1)/2-2d+2,d]]qwhere 3 ≤d≤qis odd. Some of these quantum MDS codes are new in the sense that their parameters are different from all the previously known ones.

IEEE Transactions on Information Theory•Sep 24, 2012•182 citations

A Class of Negacyclic Codes and Their Application to Quantum Codes

Junli Wang, Ruihu Li, Yang Liu +1 more

In this paper, the properties of q2-ary cyclotomic cosets modulo 2n are investigated in detail, where n=[(q2m-1)/(m(q-1))],q ≡ ±1mod m or q2≡ -1mod m when m is even and q is an odd power prime when m is power of 2. Then, non-narrow-sense negacyclic Bose-Chaudhuri-Hocquenghem (BCH) codes of length n that contain their Hermitian duals are determined. By the Hermitian construction, series of quantum codes are obtained from such negacyclic BCH codes. Compared with quantum codes in the [6], [10], [12], our constructed ones have better parameters.

International Congress on Image and Signal Processing (CISP)•Oct 1, 2019•0 citations

Quantum negacyclic codes

Xiaoshan Kai, Shixin Zhu, Yongsheng Tang

In this paper, we construct families of nonbinary quantum codes from classical negacyclic codes. The BCH bound for negacyclic codes is applied to determine the dimension and distance of these quantum codes. The parameters of these quantum codes are good compared with the ones available in the literature. We also construct a family of quantum maximum-distance-separable codes with parameters ${[[q+1,q\ensuremath{-}2d+3,d]]}_{q}$, where $q\ensuremath{\equiv}1\phantom{\rule{0.28em}{0ex}}\mathrm{mod}\phantom{\rule{0.28em}{0ex}}4$ and $2\ensuremath{\le}d\ensuremath{\le}(q+3)/2$.

Physical Review A•Jul 24, 2013•46 citations

NEW OPTIMAL ASYMMETRIC QUANTUM CODES

Jianfa Qian, LINA ZHANG

By using q2-ary cyclotomic cosets, we construct new asymmetric quantum codes with parameters [[q2+1, q2+1-2(k+i-2), (2k+3)/(2i+3)]]q2, where k and i are positive integers, and [Formula: see text]. The constructed asymmetric quantum codes are not covered by the codes available in the literature. Moreover, the constructed asymmetric quantum codes are optimal.

Modern Physics Letters B•Dec 5, 2012•17 citations

Quantum Generalized Reed-Solomon codes

Zhuo Li, Lijuan Xing, 西安电子科技大学综合业务网国家重点实验室,西安 710071

We construct a family of quantum error-correcting codes with parameters [[n,n-2k,k+1]]q which are defined in q-dimensional quantum systems,where q is an arbitrary prime power. These codes are optimal in the sense that the minimum distance is maximal. It is shown that codes exist for all n satisfying 2≤n≤q or q2-q+2≤n≤q2.

Acta Physica Sinica•Jan 1, 2008•13 citations
In this paper, we construct two classes of asymmetric quantum codes by using constacyclic codes. The first class is the asymmetric quantum codes with parameters [[q2 + 1, q2 + 1 - 2(t + k + 1), (2k + 2)/(2t + 2)]]q2 where q is an odd prime power, t, k are integers with [Formula: see text], which is a generalization of [J. Chen, J. Li and J. Lin, Int. J. Theor. Phys. 53 (2014) 72, Theorem 2] in the sense that we do not assume that q ≡1 ( mod 4). The second one is the asymmetric quantum codes with parameters [Formula: see text], where q ≥ 5 is an odd prime power, t, k are integers with 0 ≤ t ≤ k ≤ q - 1. The constructed asymmetric quantum codes are optimal and their parameters are not covered by the codes available in the literature.
In this paper, the properties of q2-ary cyclotomic cosets modulo 2n are investigated in detail, where n=[(q2m-1)/(m(q-1))],q ≡ ±1mod m or q2≡ -1mod m when m is even and q is an odd power prime when m is power of 2. Then, non-narrow-sense negacyclic Bose-Chaudhuri-Hocquenghem (BCH) codes of length n that contain their Hermitian duals are determined. By the Hermitian construction, series of quantum codes are obtained from such negacyclic BCH codes. Compared with quantum codes in the [6], [10], [12], our constructed ones have better parameters.
In this paper, we construct families of nonbinary quantum codes from classical negacyclic codes. The BCH bound for negacyclic codes is applied to determine the dimension and distance of these quantum codes. The parameters of these quantum codes are good compared with the ones available in the literature. We also construct a family of quantum maximum-distance-separable codes with parameters ${[[q+1,q\ensuremath{-}2d+3,d]]}_{q}$, where $q\ensuremath{\equiv}1\phantom{\rule{0.28em}{0ex}}\mathrm{mod}\phantom{\rule{0.28em}{0ex}}4$ and $2\ensuremath{\le}d\ensuremath{\le}(q+3)/2$.