Related papers: Construction of quantum codes based on self-dual o…
In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions when this construction can yield self-dual codes. We construct…
In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly…
Based on the group structure of a unitary Lie algebra, a scheme is provided to systematically and exhaustively generate quantum error correction codes, including the additive and nonadditive codes. The syndromes in the process of…
We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…
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…
Due to their fast decoding algorithms, quantum generalizations of low-density parity check, or LDPC, codes have been investigated as a solution to the problem of decoherence in fragile quantum states. However, the additional twisted inner…
In this paper, two new families of MDS quantum convolutional codes are constructed. The first one can be regarded as a generalization of \cite[Theorem 6.5]{GGGlinear}, in the sense that we do not assume that $q\equiv1\pmod{4}$. More…
Let $R=\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}+\cdots+u^{k}\mathbb{F}_{2^{m}}$ , where $\mathbb{F}_{2^{m}}$ is a finite field with $2^{m}$ elements, $m$ is a positive integer, $u$ is an indeterminate with $u^{k+1}=0.$ In this paper, we…
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…
The construction of self-dual codes over small fields such that their minimum distances are as large as possible is a long-standing challenging problem in the coding theory. In 2009, a family of binary self-dual cyclic codes with lengths…
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…
Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…
In this work we show that given a connectivity graph $G$ of a $[[n,k,d]]$ quantum code, there exists $\{K_i\}_i, K_i \subset G$, such that $\sum_i |K_i|\in \Omega(k), \ |K_i| \in \Omega(d)$, and the $K_i$'s are $\tilde{\Omega}(…
In this paper, we provide two methods of constructing quantum codes from linear codes over finite chain rings. The first one is derived from the Calderbank-Shor-Steane (CSS) construction applied to self-dual codes over finite chain rings.…
A new method for the construction of the binary quantum stabilizer codes is provided, where the construction is based on Abelian and non-Abelian groups association schemes. The association schemes based on non-Abelian groups are constructed…
In this paper, some nonbinary quantum codes using classical codes over Gaussian integers are obtained. Also, some of our quantum codes are better than or comparable with those known before, (for instance [[8; 2; 5]]4+i).
We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by…
We show that any binary $(n=2^m-3, 2^{n-m}, 3)$ code $C_1$ is a part of an equitable partition (perfect coloring) $\{C_1,C_2,C_3,C_4\}$ of the $n$-cube with the parameters $((0,1,n-1,0)(1,0,n-1,0)(1,1,n-4,2)(0,0,n-1,1))$. Now the…
It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…
Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. It is very hard to construct quantum MDS codes with relatively large minimum distance. In this paper, based on classical constacyclic codes, we…