4 research outputs found
Symplectic self-orthogonal quasi-cyclic codes
In this paper, we obtain sufficient and necessary conditions for quasi-cyclic
codes with index even to be symplectic self-orthogonal. Then, we propose a
method for constructing symplectic self-orthogonal quasi-cyclic codes, which
allows arbitrary polynomials that coprime to construct symplectic
self-orthogonal codes. Moreover, by decomposing the space of quasi-cyclic
codes, we provide lower and upper bounds on the minimum symplectic distances of
a class of 1-generator quasi-cyclic codes and their symplectic dual codes.
Finally, we construct many binary symplectic self-orthogonal codes with
excellent parameters, corresponding to 117 record-breaking quantum codes,
improving Grassl's table (Bounds on the Minimum Distance of Quantum Codes.
http://www.codetables.de)
Improved Spectral Bound for Quasi-Cyclic Codes
Spectral bounds form a powerful tool to estimate the minimum distances of
quasi-cyclic codes. They generalize the defining set bounds of cyclic codes to
those of quasi-cyclic codes. Based on the eigenvalues of quasi-cyclic codes and
the corresponding eigenspaces, we provide an improved spectral bound for
quasi-cyclic codes. Numerical results verify that the improved bound
outperforms the Jensen bound in almost all cases. Based on the improved bound,
we propose a general construction of quasi-cyclic codes with excellent designed
minimum distances. For the quasi-cyclic codes produced by this general
construction, the improved spectral bound is always sharper than the Jensen
bound
Distance bounds for generalized bicycle codes
Generalized bicycle (GB) codes is a class of quantum error-correcting codes
constructed from a pair of binary circulant matrices. Unlike for other simple
quantum code ans\"atze, unrestricted GB codes may have linear distance scaling.
In addition, low-density parity-check GB codes have a naturally overcomplete
set of low-weight stabilizer generators, which is expected to improve their
performance in the presence of syndrome measurement errors. For such GB codes
with a given maximum generator weight , we constructed upper distance bounds
by mapping them to codes local in dimensions, and lower existence
bounds which give . We have also done an exhaustive
enumeration of GB codes for certain prime circulant sizes in a family of
two-qubit encoding codes with row weights 4, 6, and 8; the observed distance
scaling is consistent with , where is the code length
and is increasing with .Comment: 12 pages, 5 figure