Quantum quasi-cyclic low-density parity-check codes

Authors:
Dazu Huang;Zhigang Chen;Xin Li;Ying Guo
Affiliations:
School of Information Science and Engineering, Central South University, Changsha, China and Department of Information Management, Hunan College of Finance and Economics, Changsha, China;School of Information Science and Engineering, Central South University, Changsha, China;School of Information Science and Engineering, Central South University, Changsha, China and Department of Information Management, Hunan College of Finance and Economics, Changsha, China;School of Information Science and Engineering, Central South University, Changsha, China
Venue:
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
Year:
2009

Citing 4
Cited 0

Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Sparse-graph codes for quantum error correction

IEEE Transactions on Information Theory
A finite Gilbert-Varshamov bound for pure stabilizer quantum codes

IEEE Transactions on Information Theory
Information rates achievable with algebraic codes on quantum discrete memoryless channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, how to construct quantum quasi-cyclic (QC) low-density parity-check (LDPC) codes is proposed. Using the proposed approach, some new quantum codes with various lengths and rates of no cycles-length 4 in their Tanner graph are designed. In addition, the presented quantum codes can be efficiently constructed with large codeword length. Finally, we show the decoding of the proposed quantum QC LDPC.