Barnault, L. and Declercq, D. (2003) Fast Decoding Algorithm for LDPC over GF (2q). 2003 IEEE Information Theory Workshop, Paris, 31 March-4 April 2003, 70-73.
https://doi.org/10.1109/ITW.2003.1216697

has been cited by the following article:

• TITLE: Low-Density Parity-Check Codes: Research Status and Development Direction

  AUTHORS: Jie Xu, Zhiyong Zheng, Kun Tian

  KEYWORDS: Low-Density Parity-Check (LDPC), Parity Check Matrix H, Quasi-Cyclic (QC) LDPC, Spatially Coupled Low-Density Parity-Check (SC-LDPC) Codes

  JOURNAL NAME: Journal of Information Security, Vol.13 No.4, September 23, 2022

  ABSTRACT: In this paper, we conclude five kinds of methods for construction of the regular low-density parity matrix H and three kinds of methods for the construction of irregular low-density parity-check matrix H. Through the analysis of the code rate and parameters of these eight kinds of structures, we find that the construction of low-density parity-check matrix tends to be more flexible and the parameter variability is enhanced. We propose that the current development cost should be lower with the progress of electronic technology and we need research on more practical Low-Density Parity-Check Codes (LDPC). Combined with the application of the quantum distribution key, we urgently need to explore the research direction of relevant theories and technologies of LDPC codes in other fields of quantum information in the future.