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:1212.4654 · IEEE Transactions on Information Theory

On Classical and Quantum MDS-Convolutional BCH Codes

Giuliano G. La Guardia

Published Jan 1, 2014• 34 citations
arXivHTMLPDF

Abstract

Several new families of multi-memory classical convolutional Bose-Chaudhuri-Hocquenghem codes as well as families of unit-memory quantum convolutional codes are constructed in this paper. Our unit-memory classical and quantum convolutional codes are optimal in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search.

DOI
10.1109/tit.2013.2287693

Related papers

On nonbinary quantum convolutional BCH codes

Giuliano G. La Guardia

Several new families of nonbinary quantum convolutional Bose-Chaud-huri-Hocquenghem (BCH) codes are constructed in this paper. These code constructions are performed algebraically and not by computation search. The quantum convolutional codes constructed here have parameters better than the ones available in the literature and they have non-catastrophic encoders and encoder inverses. These new families consist of unit-memory as well as multi-memory convolutional stabilizer codes.

Quantum Information and Computation•Sep 1, 2012•12 citations

Construction of Some New Quantum BCH Codes

Ming Zhang, Zhuo Li, Lijuan Xing +1 more

Classical Bose-Chaudhuri-Hocquenghem (BCH) codes over finite fields have been studied extensively. One can construct quantum stabilizer codes with good parameters using classical BCH codes. In this paper, our goal is to find such classical BCH codes. We study some properties of suitable cyclotomic cosets at first. These results make it possible to construct nonbinary quantum BCH codes with a given parameter set. Several new families of quantum BCH codes obtained are based on Steane's enlargement of nonbinary Calderbank-Shor-Steane codes and Hermitian construction, respectively. Meanwhile, we have shown that the cyclotomic cosets given in our schemes are optimal to design quantum BCH codes. The defining set contains most consecutive integers. Therefore, corresponding quantum stabilizer codes have better lower bound of minimum distance. Furthermore, it is convenient to compute the dimension of new quantum codes. Compared with the ones available in the literature, the quantum BCH codes in our schemes have good parameters. In particular, we extend known results to more general case.

IEEE Access•Jan 1, 2018•20 citations

Some families of optimal quantum codes derived from constacyclic codes

Jian‐Zhang Chen, Yuanyuan Huang, Chunhui Feng +1 more

Quantum maximum-distance-separable (MDS) codes form an important family of quantum codes. Quantum MDS codes are optimal, which can attain the quantum Singleton bound. In this paper, using some classes of constacyclic codes and Hermitian constructions, we propose the constructions of optimal quantum convolutional codes and optimal asymmetric quantum codes in the sense of the quantum Singleton bound. Compared with the codes obtained in the literature, the parameters of the constructed quantum codes are new as well as the distance dz of optimal asymmetric quantum codes [[n,k,dz/dx]]q2 constructed in this paper is larger.

Linear and Multilinear Algebra•Feb 5, 2018•8 citations

New optimal quantum convolutional codes

Shixin Zhu, Liqi Wang, Xiaoshan Kai

One of the most challenges to prove the feasibility of quantum computers is to protect the quantum nature of information. Quantum convolutional codes are aimed at protecting a stream of quantum information in a long distance communication, which are the correct generalization to the quantum domain of their classical analogs. In this paper, we construct some classes of quantum convolutional codes by employing classical constacyclic codes. These codes are optimal in the sense that they attain the Singleton bound for pure convolutional stabilizer codes.

International Journal of Quantum Information•Apr 1, 2015•6 citations

1 On the Construction of Nonbinary Quantum BCH Codes

Giuliano G. La Guardia

Four quantum code constructions generating several new families of good nonbinary quantum nonprimitive nonnarrow-sense, Bose-Chaudhuri-Hocquenghem codes, are presented in this paper. The first two are based on Calderbank-Shor-Steane (CSS) construction derived from two nonprimitive Bose-Chaudhuri-Hocquenghem codes. The third one is based on Steane's enlargement of nonbinary CSS codes applied to suitable subfamilies of nonprimitive nonnarrow-sense Bose-Chaudhuri-Hocquenghem codes. The fourth construction is derived from suitable subfamilies of Hermitian dual-containing nonprimitive nonnarrow-sense Bose-Chaudhuri-Hocquenghem codes. These constructions generate new families of quantum codes whose parameters are better than the ones available in the literature.

•Aug 16, 2016•39 citations

New quantum codes derived from a family of antiprimitive BCH codes

Yang Liu, Ruihu Li, Liangdong Lü +1 more

The Bose–Chaudhuri–Hocquenghem (BCH) codes have been studied for more than 57 years and have found wide application in classical communication system and quantum information theory. In this paper, we study the construction of quantum codes from a family of [Formula: see text]-ary BCH codes with length [Formula: see text] (also called antiprimitive BCH codes in the literature), where [Formula: see text] is a power of 2 and [Formula: see text]. By a detailed analysis of some useful properties about [Formula: see text]-ary cyclotomic cosets modulo [Formula: see text], Hermitian dual-containing conditions for a family of non-narrow-sense antiprimitive BCH codes are presented, which are similar to those of [Formula: see text]-ary primitive BCH codes. Consequently, via Hermitian Construction, a family of new quantum codes can be derived from these dual-containing BCH codes. Some of these new antiprimitive quantum BCH codes are comparable with those derived from primitive BCH codes.

International Journal of Quantum Information•Oct 1, 2017•4 citations
Several new families of multi-memory classical convolutional Bose-Chaudhuri-Hocquenghem codes as well as families of unit-memory quantum convolutional codes are constructed in this paper. Our unit-memory classical and quantum convolutional codes are optimal in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search.
Classical Bose-Chaudhuri-Hocquenghem (BCH) codes over finite fields have been studied extensively. One can construct quantum stabilizer codes with good parameters using classical BCH codes. In this paper, our goal is to find such classical BCH codes. We study some properties of suitable cyclotomic cosets at first. These results make it possible to construct nonbinary quantum BCH codes with a given parameter set. Several new families of quantum BCH codes obtained are based on Steane's enlargement of nonbinary Calderbank-Shor-Steane codes and Hermitian construction, respectively. Meanwhile, we have shown that the cyclotomic cosets given in our schemes are optimal to design quantum BCH codes. The defining set contains most consecutive integers. Therefore, corresponding quantum stabilizer codes have better lower bound of minimum distance. Furthermore, it is convenient to compute the dimension of new quantum codes. Compared with the ones available in the literature, the quantum BCH codes in our schemes have good parameters. In particular, we extend known results to more general case.
Quantum maximum-distance-separable (MDS) codes form an important family of quantum codes. Quantum MDS codes are optimal, which can attain the quantum Singleton bound. In this paper, using some classes of constacyclic codes and Hermitian constructions, we propose the constructions of optimal quantum convolutional codes and optimal asymmetric quantum codes in the sense of the quantum Singleton bound. Compared with the codes obtained in the literature, the parameters of the constructed quantum codes are new as well as the distance dz of optimal asymmetric quantum codes [[n,k,dz/dx]]q2 constructed in this paper is larger.
One of the most challenges to prove the feasibility of quantum computers is to protect the quantum nature of information. Quantum convolutional codes are aimed at protecting a stream of quantum information in a long distance communication, which are the correct generalization to the quantum domain of their classical analogs. In this paper, we construct some classes of quantum convolutional codes by employing classical constacyclic codes. These codes are optimal in the sense that they attain the Singleton bound for pure convolutional stabilizer codes.
Four quantum code constructions generating several new families of good nonbinary quantum nonprimitive nonnarrow-sense, Bose-Chaudhuri-Hocquenghem codes, are presented in this paper. The first two are based on Calderbank-Shor-Steane (CSS) construction derived from two nonprimitive Bose-Chaudhuri-Hocquenghem codes. The third one is based on Steane's enlargement of nonbinary CSS codes applied to suitable subfamilies of nonprimitive nonnarrow-sense Bose-Chaudhuri-Hocquenghem codes. The fourth construction is derived from suitable subfamilies of Hermitian dual-containing nonprimitive nonnarrow-sense Bose-Chaudhuri-Hocquenghem codes. These constructions generate new families of quantum codes whose parameters are better than the ones available in the literature.
The Bose–Chaudhuri–Hocquenghem (BCH) codes have been studied for more than 57 years and have found wide application in classical communication system and quantum information theory. In this paper, we study the construction of quantum codes from a family of [Formula: see text]-ary BCH codes with length [Formula: see text] (also called antiprimitive BCH codes in the literature), where [Formula: see text] is a power of 2 and [Formula: see text]. By a detailed analysis of some useful properties about [Formula: see text]-ary cyclotomic cosets modulo [Formula: see text], Hermitian dual-containing conditions for a family of non-narrow-sense antiprimitive BCH codes are presented, which are similar to those of [Formula: see text]-ary primitive BCH codes. Consequently, via Hermitian Construction, a family of new quantum codes can be derived from these dual-containing BCH codes. Some of these new antiprimitive quantum BCH codes are comparable with those derived from primitive BCH codes.