Li Yuan, Guo Ying
School of Electronic Information Engineering, Shanghai Dianji University, Shanghai 200240, China.
School of Computer Science and Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China.
Entropy (Basel). 2023 Sep 8;25(9):1309. doi: 10.3390/e25091309.
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.
受GF(2)上一类二元循环分块矩阵的启发,我们提出了一种构造方法来获得长长度量子纠错码(QECC)的稳定子。稳定子量子码(SQCs)可通过所生成的循环置换矩阵的不同行得到;因此,这些量子码具有快速构造算法的优点。所提出的方法采用了分块矩阵的递归关系,从而可以轻松构造长长度量子循环码的生成矩阵。此外,所得到的量子码具有低密度优势,即 Tanner 图中不存在4 - 圈。