Quantum LDPC Codes Based on Cocyclic Block Matrices

Abstract

Motivated by a family of binary cocyclic block matrices over GF(2), we proposed a construction method to gain the stabilizer of long-length quantum error-correction codes (QECCs). Stabilizer quantum codes (SQCs) can be obtained by the different rows of the yielded circulant permutation matrices; hence, the quantum codes have the virtue of a fast construction algorithm. The recursive relation of a block matrix is employed in the proposed approach, so that the generator matrix of quantum cocyclic codes with long length can be constructed easily. Furthermore, the obtained quantum codes have the low-density advantage of there being no 4-cycles in the Tanner graph.