Quantum Quasi-Cyclic LDPC Codes
Abstract
In this paper, a construction of a pair of "regular" quasi-cyclic LDPC codes as ingredient codes for a quantum error-correcting code is proposed. That is, we find quantum regular LDPC codes with various weight distributions. Furthermore our proposed codes have lots of variations for length, code rate. These codes are obtained by a descrete mathematical characterization for model matrices of quasi-cyclic LDPC codes. Our proposed codes achieve a bounded distance decoding (BDD) bound, or known as VG bound, and achieve a lower bound of the code length.
- Publication:
-
arXiv e-prints
- Pub Date:
- January 2007
- DOI:
- 10.48550/arXiv.quant-ph/0701020
- arXiv:
- arXiv:quant-ph/0701020
- Bibcode:
- 2007quant.ph..1020H
- Keywords:
-
- Quantum Physics;
- Computer Science - Information Theory;
- Mathematical Physics;
- Mathematics - Combinatorics
- E-Print:
- 18 pages, 1 figures, published in proc. of ISIT 2007, (2007 IEEE International Symposium on Information Theory)