DOI QR코드

DOI QR Code

A Class of Check Matrices Constructed from Euclidean Geometry and Their Application to Quantum LDPC Codes

  • Dong, Cao (School of Electronic Engineering and Optoelectronic Technology, Nanjing University of Science and Technology) ;
  • Yaoliang, Song (School of Electronic Engineering and Optoelectronic Technology, Nanjing University of Science and Technology)
  • Received : 2012.01.10
  • Accepted : 2012.04.22
  • Published : 2013.02.28

Abstract

A new class of quantum low-density parity-check (LDPC) codes whose parity-check matrices are dual-containing matrices constructed based on lines of Euclidean geometries (EGs) is presented. The parity-check matrices of our quantum codes contain one and only one 4-cycle in every two rows and have better distance properties. However, the classical parity-check matrix constructed from EGs does not satisfy the condition of dual-containing. In some parameter conditions, parts of the rows in the matrix maybe have not any nonzero element in common. Notably, we propose four families of fascinating structure according to changes in all the parameters, and the parity-check matrices are adopted to satisfy the requirement of dual-containing. Series of matrix properties are proved. Construction methods of the parity-check matrices with dual-containing property are given. The simulation results show that the quantum LDPC codes constructed by this method perform very well over the depolarizing channel when decoded with iterative decoding based on the sum-product algorithm. Also, the quantum codes constructed in this paper outperform other quantum codes based on EGs.

Keywords

References

  1. R. G. Gallager, "Low-density parity-check codes," in Ph.D. dissertation, Boston, USA, Apr. 1963.
  2. D. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, pp. 399-431, Mar. 1999. https://doi.org/10.1109/18.748992
  3. A. R. Calderbank and P. W. Shor, "Good quantum error-correcting codes exist," in Phys. Rev. A, vol. 54, pp. 1098-1105, Aug. 1996. https://doi.org/10.1103/PhysRevA.54.1098
  4. D. MacKay, G. Mitchison, and P. McFadden, "Sparse graph codes for quantum error-correction," IEEE Trans. Inf. Theory, vol. 50, pp. 2315-2330, Oct. 2004. https://doi.org/10.1109/TIT.2004.834737
  5. Y. Fujiwara and M. H. Hsieh, "Adaptively correcting quantum errors with entanglement," in Proc. IEEE ISIT, Petersburg, Russia, May 2011, pp. 279-283.
  6. S. A. Aly, "A Class of quantum LDPC codes constructed from finite geometries," in IEEE GLOBECOM, New Orleans, USA, Nov. 2008, pp. 1097-1101.
  7. M. F. Ezerman, S. Ling, and P. Sole, "Additive asymmetric quantum codes," IEEE Trans. Inf. Theory, vol. 57, pp. 5536-5550, Aug. 2011. https://doi.org/10.1109/TIT.2011.2159040
  8. M. Hagiwara and H. Imai, "Quantum quasi-cyclic LDPC codes," in Proc. IEEE ISIT, Nice, France, June 2007, pp. 806-810.
  9. M. H. Hsieh, W. T. Yen, and L. Y. Hsu, "High performance entanglementassisted quantum LDPC codes need little entanglement," IEEE Trans. Inf. Theory, vol. 57, pp. 1761-1769, Mar. 2011. https://doi.org/10.1109/TIT.2011.2104590
  10. I. B. Djordjevic, "Quantum LDPC codes from balanced incomplete block designs," IEEE Commun. Lett., vol. 12, pp. 389-391, May 2008. https://doi.org/10.1109/LCOMM.2008.080083
  11. G. Liva, S. Song, L. Lan, Y. Zhang, S. Lin, and W. E. Ryan, "Design of LDPC codes: A survey and new results," J. Commun. Software Syst., vol. 2, pp. 191-211, Sept. 2006.