Quantum Quasi-Cyclic LDPC Codes
Quantum Physics
2016-11-18 v4 Information Theory
Mathematical Physics
Combinatorics
math.IT
math.MP
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.
Keywords
Cite
@article{arxiv.quant-ph/0701020,
title = {Quantum Quasi-Cyclic LDPC Codes},
author = {Manabu Hagiwara and Hideki Imai},
journal= {arXiv preprint arXiv:quant-ph/0701020},
year = {2016}
}
Comments
18 pages, 1 figures, published in proc. of ISIT 2007, (2007 IEEE International Symposium on Information Theory)