Related papers: Quantum Codes from Linear Codes over Finite Chain …
CSS codes are a subfamily of stabilizer codes especially appropriate for fault-tolerant quantum computations. A very simple method is proposed to encode a general qudit when a Calderbank-Shor-Steane quantum code, defined over a q-ary…
We characterize the affine-invariant maximal extended cyclic codes. Then by the CSS construction, we derive from these codes a family of pure quantum codes. Also for ordnq even, a new family of degenerate quantum stabilizer codes is derived…
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…
A new Gray map which is both an isometry and a weight preserving map from R=F_2+vF_2+v^2F_2 to (F_2)^3 is defined. A construction for quantum error correcting codes from cyclic codes over finite ring R=F_2+vF_2+v^2F_2, v^3=v is given. The…
This paper introduces a construction of quantum CSS codes from a tuple of component CSS codes and two collections of subsets. The resulting codes have parallelizable encoding and syndrome measurement circuits and built-in redundancy in the…
Using the Calderbank-Shor-Steane (CSS) construction, pure $q$-ary asymmetric quantum error-correcting codes attaining the quantum Singleton bound are constructed. Such codes are called pure CSS asymmetric quantum maximum distance separable…
We discuss a method to construct quantum codes correcting amplitude damping errors via code concatenation. The inner codes are chosen as asymmetric Calderbank-Shor-Steane (CSS) codes. By concatenating with outer codes correcting symmetric…
Four quantum code constructions generating several new families of good nonbinary quantum nonprimitive non-narrow-sense Bose-Chaudhuri-Hocquenghem (BCH) codes are presented in this paper. The first two ones are based on…
Stabilizer codes obtained via CSS code construction and Steane's enlargement of subfield-subcodes and matrix-product codes coming from generalized Reed-Muller, hyperbolic and affine variety codes are studied. Stabilizer codes with good…
Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…
Let $\mathbb{Z}_p$ be the ring of integers modulo a prime number $p$ where $p-1$ is a quadratic residue modulo $p$. This paper presents the study of constacyclic codes over chain rings $\mathcal{R}=\frac{\mathbb{Z}_p[u]}{\langle…
We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…
In this study, we investigate the construction of quantum CSS duadic codes with dimensions greater than one. We introduce a method for extending smaller splittings of quantum duadic codes to create larger, potentially degenerate quantum…
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in…
We introduce a Gray map from $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}$ to $\mathbb{F}_{2}^{2m}$ and study $(1+u)$-constacyclic codes over $\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}},$ where $u^{2}=0.$ It is proved that the image of a…
Several notions of code products are known in quantum error correction, such as hyper-graph products, homological products, lifted products, balanced products, to name a few. In this paper we introduce a new product code construction which…
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat…
A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…
Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we…
Quantum synchronizable codes are quantum error correcting codes that can correct not only Pauli errors but also errors in block synchronization. The code can be constructed from two classical cyclic codes $\mathcal{C}$, $\mathcal{D}$…