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 International Symposium on Information Theory (ISIT)

On existence of good self-dual quasi-cyclic codes

Bikash Kumar Dey

Published Dec 23, 2004• 0 citations
Publisher

Abstract

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.

DOI
10.1109/isit.2004.1365220

Related papers

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

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

A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)

Tadao Kasami

It is shown that there exist arbitrarily long quasi-cyclic(2k,k)binary codes that meet a bound slightly weaker than the Gilbert-Varshamov bound. This is a refinement of the result of Chen, Peterson, and Weldon [1].

IEEE Transactions on Information Theory•Sep 1, 1974•143 citations

QUANTUM SELF-DUAL CODES AND SYMMETRIC MATRICES

Vladimir D. Tonchev

It is proved that a subclass of self-dual quantum-error-correcting codes of length n obtained from binary linear codes of length 2n defined by symmetric matrices, contains codes that meet the Gilbert-Varshamov bound.

•Dec 1, 2000•0 citations

A Construction of Infinite Families of Good Self-Orthogonal Quasi-Cyclic Codes

Bastos, Gustavo Terra, Álvarez, Angelynn, Williams, Cameron

Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to the Euclidean and Hermitian inner products. In particular, their dimension and a lower bound for their minimum distance are computed using their constituent codes defined over field extensions of $\mathbb{F}_q$. We also show that the lower bound for the minimum distance satisfies the square-root-like lower bound and also show how dual-containing and self-dual quasi-cyclic codes can arise from our construction. Using the CSS construction, we show the existence of quantum error-correcting codes with good parameters.

arXiv:2511.02813•Nov 4, 2025•0 citations

A Varshamov-Gilbert bound for a class of formally self-dual codes and related quantum codes

Vladimir D. Tonchev

It is proved that a class of q-ary (2n,n) formally self-dual codes obtained from symmetric matrices over GF (q), contains codes that meet the Varshamov-Gilbert bound. The codes are self-dual with respect to the symplectic inner product and yield quantum codes encoding one state with n q-ary qubits and having minimum distance proportional to n.

IEEE Transactions on Information Theory•Apr 1, 2002•2 citations
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.
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.
Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to the Euclidean and Hermitian inner products. In particular, their dimension and a lower bound for their minimum distance are computed using their constituent codes defined over field extensions of Fq\mathbb{F}_qFq​. We also show that the lower bound for the minimum distance satisfies the square-root-like lower bound and also show how dual-containing and self-dual quasi-cyclic codes can arise from our construction. Using the CSS construction, we show the existence of quantum error-correcting codes with good parameters.