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:2401.15265 · Designs Codes and Cryptography

A method for constructing quaternary Hermitian self-dual codes and an application to quantum codes

Masaaki Harada

Published May 21, 2024• 1 citation
arXivHTMLPDF

Abstract

Abstract We introduce quaternary modified four $$\mu $$ μ -circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four $$\mu $$ μ -circulant Hermitian self-dual codes. We also construct quaternary modified four $$\mu $$ μ -circulant Hermitian self-dual codes having large minimum weights. Two quaternary Hermitian self-dual [56, 28, 16] codes are constructed for the first time. These codes improve the previously known lower bound on the largest minimum weight among all quaternary (linear) [56, 28] codes. In addition, these codes imply the existence of a quantum [[56, 0, 16]] code.

DOI
10.1007/s10623-024-01421-x

Related papers

Construction of Hermitian Self-Orthogonal Codes and Application

Yuezhen Ren, Ruihu Li, Hao Song

We introduce some methods for constructing quaternary Hermitian self-orthogonal (HSO) codes, and construct quaternary [n, 5] HSO for 342≤n≤492. Furthermore, we present methods of constructing Hermitian linear complementary dual (HLCD) codes from known HSO codes, and obtain many HLCD codes with good parameters. As an application, 31 classes of entanglement-assisted quantum error correction codes (EAQECCs) with maximal entanglement can be obtained from these HLCD codes. These new EAQECCs have better parameters than those in the literature.

Mathematics•Jul 5, 2024•3 citations

Quaternary Hermitian Linear Complementary Dual Codes

Makoto Araya, Masaaki Harada, Ken Saito

The largest minimum weights among quaternary Hermitian linear complementary dual codes are known for dimension 2. In this paper, we give some conditions on the nonexistence of quaternary Hermitian linear complementary dual codes with large minimum weights. As a consequence, we completely determine the largest minimum weights for dimension 3, by using a classification of some quaternary codes. In addition, for a positive integer s, an entanglement-assisted quantum error-correcting [[21s + 5, 3, 16s + 3; 21s + 2]] code with maximal entanglement is constructed for the first time from a quaternary Hermitian linear complementary dual [26, 3, 19] code.

arXiv:1904.07517•IEEE Transactions on Information Theory•Oct 30, 2019•23 citations

New binary quantum codes from Hermitian dual-containing Quasi-cyclic codes

Liangdong Lü, Gaochi Zhang, FENG Ganyu +1 more

In this paper, we introduce a class of dualcontaining 2 -generator quasi-cyclic codes over $G F(4)$. By Hermitian construction, we show computation constructions of binary quantum codes with good parameters from quaternary quasi-cyclic codes. Furthermore, 3 new quantum codes [[42, 10, 9]], [[74,,36, 9]] and [[78, 40, 9]] are derived from Hermitian dual-containing quasi-cyclic codes by an exhaustive search, along with 24 newly derived codes that enhance the previously best-known lower bounds on minimum distance.

International Symposium on AI and Cybersecurity (ISAICS)•Oct 24, 2025•0 citations

A doubling construction for self-orthogonal codes

Vladimir D. Tonchev

A simple construction of quaternary hermitian self-orthogonal codes with parameters $[2n+1,k+1]$ and $[2n+2,k+2]$ from a given pair of self-orthogonal $[n,k]$ codes, and its link to quantum codes is considered. As an application, an optimal quaternary linear $[28,20,6]$ dual containing code is found that yields a new optimal $[[28,12,6]]$ quantum code.

arXiv:1311.2549•Nov 11, 2013•0 citations

Some optimal entanglement-assisted quantum codes constructed from quaternary Hermitian linear complementary dual codes

Masaaki Harada

We establish the existence of optimal entanglement-assisted quantum [Formula: see text] codes for [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text], [Formula: see text] and [Formula: see text]. These codes are obtained from quaternary Hermitian linear complementary dual codes. We also give some observations on the largest minimum weights.

arXiv:1908.00244•International Journal of Quantum Information•Oct 1, 2019•7 citations

On shortening construction of self-orthogonal quaternary codes

Luobin Guo, Qiang Fu, Ruihu Li +1 more

For a given quaternary self-orthogonal (SO) code, using information of weights of codewords in the dual of the binary code generated by the supports of this SO code, one can construct new quaternary SO code by shortening method. Two methods of determining weights of codewords in the dual of the binary support code of a given large length SO code are presented. Using these methods, we construct many SO codes from a quantum 286-cap in PG(6, 4), and deduce existence of many quantum caps in PG(6, 4) and good quantum codes of distance 4.

International Workshop on Signal Design and its Applications in Communications•Sep 1, 2015•1 citation
Abstract We introduce quaternary modified four μ\mu μ μ -circulant codes as a modification of four circulant codes. We give basic properties of quaternary modified four μ\mu μ μ -circulant Hermitian self-dual codes. We also construct quaternary modified four μ\mu μ μ -circulant Hermitian self-dual codes having large minimum weights. Two quaternary Hermitian self-dual [56, 28, 16] codes are constructed for the first time. These codes improve the previously known lower bound on the largest minimum weight among all quaternary (linear) [56, 28] codes. In addition, these codes imply the existence of a quantum [[56, 0, 16]] code.
We introduce some methods for constructing quaternary Hermitian self-orthogonal (HSO) codes, and construct quaternary [n, 5] HSO for 342≤n≤492. Furthermore, we present methods of constructing Hermitian linear complementary dual (HLCD) codes from known HSO codes, and obtain many HLCD codes with good parameters. As an application, 31 classes of entanglement-assisted quantum error correction codes (EAQECCs) with maximal entanglement can be obtained from these HLCD codes. These new EAQECCs have better parameters than those in the literature.
The largest minimum weights among quaternary Hermitian linear complementary dual codes are known for dimension 2. In this paper, we give some conditions on the nonexistence of quaternary Hermitian linear complementary dual codes with large minimum weights. As a consequence, we completely determine the largest minimum weights for dimension 3, by using a classification of some quaternary codes. In addition, for a positive integer s, an entanglement-assisted quantum error-correcting [[21s + 5, 3, 16s + 3; 21s + 2]] code with maximal entanglement is constructed for the first time from a quaternary Hermitian linear complementary dual [26, 3, 19] code.
In this paper, we introduce a class of dualcontaining 2 -generator quasi-cyclic codes over GF(4)G F(4)GF(4). By Hermitian construction, we show computation constructions of binary quantum codes with good parameters from quaternary quasi-cyclic codes. Furthermore, 3 new quantum codes [[42, 10, 9]], [[74,,36, 9]] and [[78, 40, 9]] are derived from Hermitian dual-containing quasi-cyclic codes by an exhaustive search, along with 24 newly derived codes that enhance the previously best-known lower bounds on minimum distance.
A simple construction of quaternary hermitian self-orthogonal codes with parameters [2n+1,k+1][2n+1,k+1][2n+1,k+1] and [2n+2,k+2][2n+2,k+2][2n+2,k+2] from a given pair of self-orthogonal [n,k][n,k][n,k] codes, and its link to quantum codes is considered. As an application, an optimal quaternary linear [28,20,6][28,20,6][28,20,6] dual containing code is found that yields a new optimal [[28,12,6]][[28,12,6]][[28,12,6]] quantum code.
For a given quaternary self-orthogonal (SO) code, using information of weights of codewords in the dual of the binary code generated by the supports of this SO code, one can construct new quaternary SO code by shortening method. Two methods of determining weights of codewords in the dual of the binary support code of a given large length SO code are presented. Using these methods, we construct many SO codes from a quantum 286-cap in PG(6, 4), and deduce existence of many quantum caps in PG(6, 4) and good quantum codes of distance 4.