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:1704.01512

Quasi-cyclic self-dual codes of length 70

Zhdanov, Alexandre

Published Apr 5, 2017• 0 citations
arXivHTMLPDF

Abstract

In this paper we obtain a number of [70,35,12] singly even self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes). One of them is the first known code with parameters Beta=140 Gamma=0. All codes are not pure double circulant i.e. could not be represented in systematic form.
DOI
10.48550/arxiv.1704.01512

Related papers

Convolutional encoding of 60,64,68,72-bit self-dual codes

Zhdanov, Alexander

In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one of the encoder outputs and the first row in the quasi-cyclic generator matrix is replaced by the obtained row. The pure quasi-cyclic construction with K=10 is also available for [68,34,12] and [72,36,12] codes. The new [72,36,12] singly even self-dual code with parameters Beta=483 Gamma=0 was obtained.

arXiv:1702.05153•Feb 16, 2017•6 citations

On Existence of Good Self-Dual Quasi-Cyclic Codes

Bikash Kumar Dey

For a long time, asymptotically good self-dual codes have been known to exist. Asymptotically good 2-quasicyclic codes of rate 1/2 have also been known to exist for a long time. Recently, it was proved that there are binary self-dual n/3-quasicyclic codes of length n asymptotically meeting the Gilbert-Varshamov bound. Unlike 2-quasicyclic codes, which are defined to have a cyclic group of order n/2 as a subgroup of their permutation group, the n/3-quasicyclic c codes are defined with a permutation group of fixed order of 3. So, from the decoding point of view, 2-quasicyclic c codes are preferable to n/3-quasicyclic c codes. In this correspondence, with the assumption that there are infinite primes p with respect to (w r t.) which 2 is primitive, we prove that there exist classes of self-dual 2p-quasicyclic c codes and Type II 8p-quasicyclic c codes of length respectively 2p/sup 2/ and 8p/sup 2/ which asymptotically meet the Gilbert-Varshamov bound. When compared with the order of the defining permutation groups, these classes of codes lie between the 2-quasicyclic c codes and the n/3-quasicyclic c codes of length n, considered in previous works.

IEEE Transactions on Information Theory•Jul 27, 2004•15 citations

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

Weiliang Wang, Yangyu Fan, Luobin Guo

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.

Advances in intelligent systems research/Advances in Intelligent Systems Research•Jan 1, 2014•1 citation

On existence of good self-dual quasi-cyclic codes

Bikash Kumar Dey

This paper describes the existence of good self-dual quasicyclic codes. In this paper, with the assumption that there are infinite primes p for which 2 is primitive, we prove that there exist classes of self-dual 2p-quasicyclic codes and Type II 8p-quasicyclic codes of length respectively 2p/sup 2/ and 8p/sup 2/ which asymptotically meet the Gilbert-Varshamov bound.

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•0 citations

Good self-dual quasi-cyclic codes exist

San Ling, Patrick Solé

We show that there are long binary quasi-cyclic self-dual (either Type I or Type II) codes satisfying the Gilbert-Varshamov bound.

IEEE Transactions on Information Theory•Apr 1, 2003•73 citations

Circulant Based Extremal Additive Self-Dual Codes Over>tex<$hboxGF,(4)$>/tex<

Thomas Aaron Gulliver, J.-L. Kim

It is well known that the problem of finding stabilizer quantum-error-correcting codes (QECC) is transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to classify the extremal additive circulant self-dual codes of lengths up to 15, and construct good codes for lengths 16/spl les/n/spl les/27. We also classify the extremal additive 4-circulant self-dual codes of lengths 4,6,8,12,14, and 16 and most codes of length 10, and construct good codes of even lengths up to 22. Furthermore, we classify the extremal additive bordered 4-circulant self-dual codes of lengths 3,5,7,9,11,13,15, and 17, and construct good codes for lengths 19,21,23, and 25. We give the current status of known extremal (or optimal) additive self-dual codes of lengths 12 to 27.

IEEE Transactions on Information Theory•Feb 1, 2004•27 citations
In this paper we obtain the [60,30,12], [64,32,12], [68,34,12], [72,36,12] self-dual codes as tailbitting convolutional codes with the smallest constraint length K=9. In this construction one information bit is modulo two added to the one of the encoder outputs and the first row in the quasi-cyclic generator matrix is replaced by the obtained row. The pure quasi-cyclic construction with K=10 is also available for [68,34,12] and [72,36,12] codes. The new [72,36,12] singly even self-dual code with parameters Beta=483 Gamma=0 was obtained.
For a long time, asymptotically good self-dual codes have been known to exist. Asymptotically good 2-quasicyclic codes of rate 1/2 have also been known to exist for a long time. Recently, it was proved that there are binary self-dual n/3-quasicyclic codes of length n asymptotically meeting the Gilbert-Varshamov bound. Unlike 2-quasicyclic codes, which are defined to have a cyclic group of order n/2 as a subgroup of their permutation group, the n/3-quasicyclic c codes are defined with a permutation group of fixed order of 3. So, from the decoding point of view, 2-quasicyclic c codes are preferable to n/3-quasicyclic c codes. In this correspondence, with the assumption that there are infinite primes p with respect to (w r t.) which 2 is primitive, we prove that there exist classes of self-dual 2p-quasicyclic c codes and Type II 8p-quasicyclic c codes of length respectively 2p/sup 2/ and 8p/sup 2/ which asymptotically meet the Gilbert-Varshamov bound. When compared with the order of the defining permutation groups, these classes of codes lie between the 2-quasicyclic c codes and the n/3-quasicyclic c codes of length n, considered in previous works.
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.
Circulant Based Extremal Additive Self-Dual Codes Over>tex<hboxGF,(4)hboxGF,(4)hboxGF,(4)>/tex<
It is well known that the problem of finding stabilizer quantum-error-correcting codes (QECC) is transformed into the problem of finding additive self-orthogonal codes over the Galois field GF(4) under a trace inner product. Our purpose is to classify the extremal additive circulant self-dual codes of lengths up to 15, and construct good codes for lengths 16/spl les/n/spl les/27. We also classify the extremal additive 4-circulant self-dual codes of lengths 4,6,8,12,14, and 16 and most codes of length 10, and construct good codes of even lengths up to 22. Furthermore, we classify the extremal additive bordered 4-circulant self-dual codes of lengths 3,5,7,9,11,13,15, and 17, and construct good codes for lengths 19,21,23, and 25. We give the current status of known extremal (or optimal) additive self-dual codes of lengths 12 to 27.