Related papers: Good and asymptotically good quantum codes derived…
We first present a useful characterization of additive (stabilizer) quantum error-correcting codes. Then we present several examples of We first present a useful characterization of additive (stabilizer) quantum error--correcting codes.…
Many $q$-ary stabilizer quantum codes can be constructed from Hermitian self-orthogonal $q^2$-ary linear codes. This result can be generalized to $q^{2 m}$-ary linear codes, $m > 1$. We give a result for easily obtaining quantum codes from…
In this work, our main objective is to construct quantum codes from quasi-twisted (QT) codes. At first, a necessary and sufficient condition for Hermitian self-orthogonality of QT codes is introduced by virtue of the Chinese Remainder…
In this paper, we construct asymmetric quantum error-correcting codes(AQCs) based on subclasses of Alternant codes. Firstly, We propose a new subclass of Alternant codes which can attain the classical Gilbert-Varshamov bound to construct…
In this paper we extend to asymmetric quantum error-correcting codes (AQECC) the construction methods, namely: puncturing, extending, expanding, direct sum and the (u|u + v) construction. By applying these methods, several families of…
Quantum Tanner codes are a class of quantum low-density parity-check codes that provably display a linear minimum distance and a constant encoding rate in the asymptotic limit. When built from left--right Cayley complexes, they can be…
In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Z\'emor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed…
We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic…
We propose a method for constructing quantum error-correcting codes based on non-binary low-density parity-check codes with Tanner graph girth 16. While conventional constructions using circulant permutation matrices are limited to girth…
In this paper, we construct new families of convolutional codes. Such codes are obtained by means of algebraic geometry codes. Additionally, more families of convolutional codes are constructed by means of puncturing, extending, expanding…
We construct explicitly two infinite families of genuine nonadditive 1-error correcting quantum codes and prove that their coding subspaces are 50% larger than those of the optimal stabilizer codes of the same parameters via the linear…
We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain $(\mathbb{F}_2^{m\times m})^V \quad \xrightarrow{\delta^0}\quad…
We show how good quantum error-correcting codes can be constructed using generalized concatenation. The inner codes are quantum codes, the outer codes can be linear or nonlinear classical codes. Many new good codes are found, including both…
We consider quantum MDS (QMDS) codes for quantum systems of dimension $q$ with lengths up to $q^2+2$ and minimum distances up to $q+1$. We show how starting from QMDS codes of length $q^2+1$ based on cyclic and constacyclic codes, new QMDS…
Multi-twisted (MT) codes were introduced as a generalization of quasi-twisted (QT) codes. QT codes have been known to contain many good codes. In this work, we show that codes with good parameters and desirable properties can be obtained…
We introduce homothetic-BCH codes. These are a family of $q^2$-ary classical codes $\mathcal{C}$ of length $\lambda n_1$, where $\lambda$ and $n_1$ are suitable positive integers such that the punctured code $\mathcal{B}$ of $\mathcal{C}$…
In the recent paper entitled "Explicit constructions of MDS self-dual codes" accepted in { IEEE Transactions on Information Theory}, doi: 10.1109/TIT.2019.2954877, the author has constructed families of MDS self-dual codes from genus zero…
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 order to construct quantum $[[n,0,d]]$ codes for $(n,d)=(56,15)$, $(57,15)$, $(58,16)$, $(63,16)$, $(67,17)$, $(70,18)$, $(71,18)$, $(79,19)$, $(83,20)$, $(87,20)$, $(89,21)$, $(95,20)$, we construct self-dual additive…
Quantum error-correcting codes with high encoding rate are good candidates for large-scale quantum computers as they use physical qubits more efficiently than codes of the same distance that encode only a few logical qubits. Some logical…