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

IEEE Access

Construction of New Matrix-Product Codes and Their Applications

Hao Song, Ruihu Li, Junli Wang, Jingjie Lv

Published Jan 1, 2019• 3 citations
Publisher

Abstract

In this paper, from special code chains$\mathcal {C}_{1} \supseteq \mathcal {C}_{2}~\supseteq \mathcal {C}_{3}$such that$\mathcal {C}^{\bot _{h}}_{1}\subseteq \mathcal {C}_{3}$and$\mathcal {C}^{\bot _{h}}_{2}\subseteq \mathcal {C}_{2}$, some Hermitian dual-containing (HDC) matrix-product (MP) codes are presented, where$\mathcal {C}_{3}$is not HDC. By studying some constacyclic codes of lengths$n=q^{2}\pm 1$and$n=\frac {q^{2}-1}{2}$, we construct many HDC MP codes of length$3n$. Consequently, many$q$-ary quantum codes with larger designed distance$d\geq q+1$are obtained from these MP codes, where$4\leq q\leq 9$.

DOI
10.1109/access.2019.2952193

Related papers

Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal matrices and quasi-unitary matrices.

Meng Cao

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. Specifically, it follows from CSS construction (resp. Hermitian construction) that a matrix-product code over $\mathbb{F}_{q}$ (resp. $\mathbb{F}_{q^{2}}$) which is Euclidean dual-containing (resp. Hermitian dual-containing) can produce a $q$-ary quantum code. In order to obtain such matrix-product codes, a common way is to construct quasi-orthogonal matrices (resp. quasi-unitary matrices) as the defining matrices of matrix-product codes over $\mathbb{F}_{q}$ (resp. $\mathbb{F}_{q^{2}}$). The usage of NSC quasi-orthogonal matrices or NSC quasi-unitary matrices in this process enables the minimum distance lower bound of the corresponding quantum codes to reach its optimum. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in \cite{Cao2020Constructioncaowang,Cao2020New,Cao2020Constructionof}; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and $q$-ary quantum codes derived from these newly constructed matrix-product codes.

•Dec 31, 2020•1 citation

New quantum constacyclic codes with length n=2(qm+1)

Junli Wang, Ruihu Li, Yang Liu +1 more

By studying the properties of [Formula: see text]-cyclotomic cosets, the maximum designed distances of Hermitian dual-containing constacyclic Bose–Chaudhuri–Hocquenghem (BCH) codes with length [Formula: see text] are determined, where [Formula: see text] is an odd prime power and [Formula: see text] is an integer. Further, their dimensions are calculated precisely for the given designed distance. Consequently, via Hermitian Construction, many new quantum codes could be obtained from these codes, which are not covered in the literature.

International Journal of Quantum Information•Oct 1, 2019•5 citations

Quantum error-correcting codes from matrix-product codes related to quasi-orthogonal and quasi-unitary matrices

Cao, Meng

Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good $q$-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and $q$-ary quantum codes derived from these matrix-product codes.

arXiv:2012.15691•Dec 31, 2020•0 citations

Application of Constacyclic Codes to Quantum MDS Codes

Bocong Chen, San Ling, Guanghui Zhang

Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes. To get q-ary quantum MDS codes, one of the effective ways is to find linear MDS codes C over Fq2satisfying C⊥H⊆ C, where C⊥Hdenotes the Hermitian dual code of C. For a linear code C of length n over Fq2, we say that C is a dual-containing code if C⊥H⊆ C and C≠ Fq2n. Several classes of new quantum MDS codes with relatively large minimum distance have been produced through dual-containing constacyclic MDS codes. These works motivate us to make a careful study on the existence conditions for dual-containing constacyclic codes. We obtain necessary and sufficient conditions for the existence of dual-containing constacyclic codes. Four classes of dual-containing constacyclic MDS codes are constructed and their parameters are computed. Consequently, the quantum MDS codes are derived from these parameters. The quantum MDS codes exhibited here have minimum distance bigger than the ones available in the literature.

arXiv:1403.2499•IEEE Transactions on Information Theory•Jan 7, 2015•191 citations

Construction of new quantum codes via Hermitian dual-containing matrix-product codes

Meng Cao, Jianlian Cui

Quantum Information Processing•Nov 24, 2020•14 citations

Hermitian dual containing BCH codes and construction of new quantum codes

LiRuihu, ZuoFei, LiuYang +1 more

Let q ≥ 3 be a prime power. Maximal designed distances of primitive Hermitian dual containing q2-ary BCH codes (narrow-sense or non-narrow-sense) are determined by a careful analysis of properties ...

Quantum Information and Computation•Jan 1, 2013•0 citations
In this paper, from special code chainsC1⊇C2 ⊇C3\mathcal {C}_{1} \supseteq \mathcal {C}_{2}~\supseteq \mathcal {C}_{3}C1​⊇C2​ ⊇C3​such thatC1⊥h⊆C3\mathcal {C}^{\bot _{h}}_{1}\subseteq \mathcal {C}_{3}C1⊥h​​⊆C3​andC2⊥h⊆C2\mathcal {C}^{\bot _{h}}_{2}\subseteq \mathcal {C}_{2}C2⊥h​​⊆C2​, some Hermitian dual-containing (HDC) matrix-product (MP) codes are presented, whereC3\mathcal {C}_{3}C3​is not HDC. By studying some constacyclic codes of lengthsn=q2±1n=q^{2}\pm 1n=q2±1andn=q2−12n=\frac {q^{2}-1}{2}n=2q2−1​, we construct many HDC MP codes of length3n3n3n. Consequently, manyqqq-ary quantum codes with larger designed distanced≥q+1d\geq q+1d≥q+1are obtained from these MP codes, where4≤q≤94\leq q\leq 94≤q≤9.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good qqq-ary quantum codes of large length. Specifically, it follows from CSS construction (resp. Hermitian construction) that a matrix-product code over Fq\mathbb{F}_{q}Fq​ (resp. Fq2\mathbb{F}_{q^{2}}Fq2​) which is Euclidean dual-containing (resp. Hermitian dual-containing) can produce a qqq-ary quantum code. In order to obtain such matrix-product codes, a common way is to construct quasi-orthogonal matrices (resp. quasi-unitary matrices) as the defining matrices of matrix-product codes over Fq\mathbb{F}_{q}Fq​ (resp. Fq2\mathbb{F}_{q^{2}}Fq2​). The usage of NSC quasi-orthogonal matrices or NSC quasi-unitary matrices in this process enables the minimum distance lower bound of the corresponding quantum codes to reach its optimum. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in \cite{Cao2020Constructioncaowang,Cao2020New,Cao2020Constructionof}; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and qqq-ary quantum codes derived from these newly constructed matrix-product codes.
By studying the properties of [Formula: see text]-cyclotomic cosets, the maximum designed distances of Hermitian dual-containing constacyclic Bose–Chaudhuri–Hocquenghem (BCH) codes with length [Formula: see text] are determined, where [Formula: see text] is an odd prime power and [Formula: see text] is an integer. Further, their dimensions are calculated precisely for the given designed distance. Consequently, via Hermitian Construction, many new quantum codes could be obtained from these codes, which are not covered in the literature.
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain self-orthogonality over finite fields is an effective way to obtain good qqq-ary quantum codes of large length. This article has two purposes: the first is to summarize some results of this topic obtained by the author of this article and his cooperators in [10-12]; the second is to add some new results on quasi-orthogonal matrices (resp. quasi-unitary matrices), Euclidean dual-containing (resp. Hermitian dual-containing) matrix-product codes and qqq-ary quantum codes derived from these matrix-product codes.
Quantum maximum-distance-separable (MDS) codes form an important class of quantum codes. To get q-ary quantum MDS codes, one of the effective ways is to find linear MDS codes C over Fq2satisfying C⊥H⊆ C, where C⊥Hdenotes the Hermitian dual code of C. For a linear code C of length n over Fq2, we say that C is a dual-containing code if C⊥H⊆ C and C≠ Fq2n. Several classes of new quantum MDS codes with relatively large minimum distance have been produced through dual-containing constacyclic MDS codes. These works motivate us to make a careful study on the existence conditions for dual-containing constacyclic codes. We obtain necessary and sufficient conditions for the existence of dual-containing constacyclic codes. Four classes of dual-containing constacyclic MDS codes are constructed and their parameters are computed. Consequently, the quantum MDS codes are derived from these parameters. The quantum MDS codes exhibited here have minimum distance bigger than the ones available in the literature.