摘要
在低密度奇偶校验码和量子纠错理论基础上,分析了基于稀疏矩阵的量子LDPC码的构造方法,提出了一种量子CSS码的编码实现过程中有效的陪集搜索方法,以(3,8)(16,6)量子LDPC码的构造过程为例说明此陪集搜索算法的有效性,并与现有的陪集寻找算法进行了比较。数值计算结果表明,改进的陪集搜索算法在获得与传统搜索方法相近的性能情况下编码速度有了显著提高,同时克服了传统陪集搜索算法中量子码字的存储问题。
Based on the classical LDPC construction method and quantum error correction techniques, a construction method of quantum low-density-parity-check codes is discussed and a novel coset searching algorithm which is important in the construction method is developed in this paper. We select quantum code (3,8) (16,6) as an example to verify this algorithm and compare it with the conventional one. The result shows that the algorithm can improve the encoding efficiency and reduce complexity with the same performance as the conventional one. At the same time, the algorithm can slove the problem of storage of quantum codes.
出处
《南京邮电大学学报(自然科学版)》
2008年第4期53-56,61,共5页
Journal of Nanjing University of Posts and Telecommunications:Natural Science Edition
基金
国家自然科学基金(60672133)
江苏省自然科学基金(BK2006236)
江苏省青蓝工程(TJ207006)
教育部博士点专项科研基金(20060293003)资助项目
关键词
量子CSS码
陪集
量子LDPC码
BP译码
Calderback-shor-steane codes
Coset
Quantum low-density parity-check codes
Belief propagation decoding algorithm