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

Advances in intelligent systems research/Advances in Intelligent Systems Research

Binary Generalized Quasi-Cyclic Self-orthogonal Codes and Binary Construction of Pure Quantum Codes

Weiliang Wang, Yangyu Fan, Luobin Guo

Published Jan 1, 2014• 1 citation
Publisher

Abstract

In this paper, a special subclass of binary generalized quasi-cyclic self-orthogonal codes and quantum codes constructed by Steane construction are discussed.Firstly, eight 16-dimensional even length generalized quasi-cyclic self-orthogonal codes with dual distance five are built based on circulant or partial circulant matrices.Secondly, pairs of nested self-orthogonal codes with dual distance five and three are designed by applying an algorithm for searching subcodes of a given code.Thirdly, revised pairs of codes with dual distance six and four are constructed by extending previous pairs of codes, and then eight quantum codes with distance six are obtained by Steane construction.These eight quantum codes are new binary construction by Steane construction and are best known ones.

DOI
10.2991/icfcce-14.2014.35

Related papers

Combinational Construction of Self-orthogonal Codes and Its Application

Jian Liu

Quantum error-correcting codes protect quantum information against undesirable noise in quantum computation and quantum communication.It is one of important problems that constructing very good quantum codes.There are two methods that use binary codes to construct quantum codes,one is CSS construction,another is Steane construction.These two methods are all based on the construction of binary self-orthogonal codes.Combinational construction of binary self-orthogonal codes is investigated in this paper.From known codes chains of binary self-orthogonal codes and their dual codes chains with given dual distance,new binary self-orthogonal codes of dual distance three,four,five and six are constructed.Based on these results,for each satisfying,S-chains with parameters and are constructed.According to Steane's construction,many very good quantum codes of distance five and six are constructed by the obtained S-chains,some of these quantum codes are new and some of these quantum codes have improved parameters than previously known codes.

Journal of Air Force Engineering University•Jan 1, 2009•0 citations

Subcodes of binary self-dual codes of minimum distance six

Xuejun Zhao

The subcodes of binary self-dual codes whose length n between 22 and 30 and minimum distance six are studied by using of a random search algorithm,and the subcodes of dual distance 3,4,5 and 6 of these self-dual codes are constructed.The code chains of these self-orthogonal subcodes and the S-chains obtained from the dual of these self-orthogonal subcodes are also determined.According to Steane’s construction,some very good quantum codes of distance five and six are constructed by the obtained S-chains,and some of these quantum codes have improved parameters than previously known codes.

Computer Engineering and Applications Journal•Jan 1, 2008•0 citations

Binary Construction of Quantum Codes of Minimum Distance Three and Four

Ruihu Li, Xinran Li

We give elementary recursive constructions of binary self-orthogonal codes with dual distance four for all even lengths n/spl ges/12 and n=8. Consequently, good quantum codes of minimum distance three and four for such length n are obtained via Steane's construction and the CSS construction. Previously, such quantum codes were explicitly constructed only for a sparse set of lengths. Almost all of our quantum codes of minimum distance three are optimal or near optimal, and some of our minimum-distance four quantum codes are better than or comparable with those known before.

IEEE Transactions on Information Theory•Jun 1, 2004•67 citations

Quantum Codes Constructed from Self-Dual Codes and Maximal Self-Orthogonal Codes Over F5

Luobin Guo, Yuena Ma, Youqian Feng

Subcodes of some known maximal self-orthogonal codes and optimal self-dual codes of length n between 9 and 22 over F5 are studied. Using a random search algorithm, we construct subcodes with given dual distance 2, 3, 4, 5 and 6 from these known codes, and discuss code chains formed by obtained subcodes and their dual codes. Based on these obtained code chains, we construct many quantum codes of distance 3, 4, 5, 6 and 8 by using of Steane's construction, some of these quantum codes are present known best codes.

Procedia Engineering•Jan 1, 2012•0 citations

Construction of S-chains and quantum codes based on three self-dual codes

LI Rui-hu

By using of a random searching algorithm and classical group theory,the subcodes which dual distance between 3 and 7 of three double circulant self-dual codes D3,D4 and D5 are studied.The relation of these subcodes and the subcode chains of these self-orthogonal codes are determined,and the S-chains deduced from these self-orthogonal codes are also presented.Accord- ing to Steane’s construction and the S-chains obtained,some new quantum codes with good parameters are constructed.

Computer Engineering and Applications Journal•Jan 1, 2009•0 citations

Binary minimum self-orthogonal codes of dual distance five and their subcodes

Luobin Guo

The equivalence of maximal self-orthogonal codes obtained from binary self-dual codes by truncating are discussed.Many non-equivalent maximal self-orthogonal codes of length 21≤n≤29 and dual distance five are constructed by truncating self-dual codes of dual distance six.Subcodes of these maximal self-orthogonal codes are studied by using of a random search algorithm,and the subcodes of dual distance 3 and 5 of these maximal self-orthogonal codes are constructed.The code chains of these self-orthogonal subcodes and the S-chains obtained from the dual of these self-orthogonal subcodes are also determined.According to Steane’s construction,some very good quantum codes of distance five are constructed by the obtained S-chains.

Computer Engineering and Applications Journal•Jan 1, 2007•0 citations
In this paper, a special subclass of binary generalized quasi-cyclic self-orthogonal codes and quantum codes constructed by Steane construction are discussed.Firstly, eight 16-dimensional even length generalized quasi-cyclic self-orthogonal codes with dual distance five are built based on circulant or partial circulant matrices.Secondly, pairs of nested self-orthogonal codes with dual distance five and three are designed by applying an algorithm for searching subcodes of a given code.Thirdly, revised pairs of codes with dual distance six and four are constructed by extending previous pairs of codes, and then eight quantum codes with distance six are obtained by Steane construction.These eight quantum codes are new binary construction by Steane construction and are best known ones.
Quantum error-correcting codes protect quantum information against undesirable noise in quantum computation and quantum communication.It is one of important problems that constructing very good quantum codes.There are two methods that use binary codes to construct quantum codes,one is CSS construction,another is Steane construction.These two methods are all based on the construction of binary self-orthogonal codes.Combinational construction of binary self-orthogonal codes is investigated in this paper.From known codes chains of binary self-orthogonal codes and their dual codes chains with given dual distance,new binary self-orthogonal codes of dual distance three,four,five and six are constructed.Based on these results,for each satisfying,S-chains with parameters and are constructed.According to Steane's construction,many very good quantum codes of distance five and six are constructed by the obtained S-chains,some of these quantum codes are new and some of these quantum codes have improved parameters than previously known codes.
The subcodes of binary self-dual codes whose length n between 22 and 30 and minimum distance six are studied by using of a random search algorithm,and the subcodes of dual distance 3,4,5 and 6 of these self-dual codes are constructed.The code chains of these self-orthogonal subcodes and the S-chains obtained from the dual of these self-orthogonal subcodes are also determined.According to Steane’s construction,some very good quantum codes of distance five and six are constructed by the obtained S-chains,and some of these quantum codes have improved parameters than previously known codes.
We give elementary recursive constructions of binary self-orthogonal codes with dual distance four for all even lengths n/spl ges/12 and n=8. Consequently, good quantum codes of minimum distance three and four for such length n are obtained via Steane's construction and the CSS construction. Previously, such quantum codes were explicitly constructed only for a sparse set of lengths. Almost all of our quantum codes of minimum distance three are optimal or near optimal, and some of our minimum-distance four quantum codes are better than or comparable with those known before.
Subcodes of some known maximal self-orthogonal codes and optimal self-dual codes of length n between 9 and 22 over F5 are studied. Using a random search algorithm, we construct subcodes with given dual distance 2, 3, 4, 5 and 6 from these known codes, and discuss code chains formed by obtained subcodes and their dual codes. Based on these obtained code chains, we construct many quantum codes of distance 3, 4, 5, 6 and 8 by using of Steane's construction, some of these quantum codes are present known best codes.
The equivalence of maximal self-orthogonal codes obtained from binary self-dual codes by truncating are discussed.Many non-equivalent maximal self-orthogonal codes of length 21≤n≤29 and dual distance five are constructed by truncating self-dual codes of dual distance six.Subcodes of these maximal self-orthogonal codes are studied by using of a random search algorithm,and the subcodes of dual distance 3 and 5 of these maximal self-orthogonal codes are constructed.The code chains of these self-orthogonal subcodes and the S-chains obtained from the dual of these self-orthogonal subcodes are also determined.According to Steane’s construction,some very good quantum codes of distance five are constructed by the obtained S-chains.