Quantum Quasi-Cyclic LDPC Codes
arXiv:quant-ph/0701020 · doi:10.1109/ISIT.2007.4557323
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.
18 pages, 1 figures, published in proc. of ISIT 2007, (2007 IEEE International Symposium on Information Theory)
Cited by in corpus (14)
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Degenerate Quantum LDPC Codes With Good Finite Length Performance
- Quantum LDPC Codes with Almost Linear Minimum Distance
- Entanglement-assisted quantum turbo codes
- High performance entanglement-assisted quantum LDPC codes need little entanglement
- Trapping Sets of Quantum LDPC Codes
- A Class of Quantum LDPC Codes Constructed From Finite Geometries
- Refined Belief Propagation Decoding of Sparse-Graph Quantum Codes
- Quantum Error Correction beyond the Bounded Distance Decoding Limit
- The Road From Classical to Quantum Codes: A Hashing Bound Approaching Design Procedure
- Quantum codes from affine variety codes and their subfield-subcodes
- New Binary Quantum Codes Constructed from Quasi-Cyclic Codes
- Quantum Error Correction near the Coding Theoretical Bound
- Error Correction for Reliable Quantum Computing