Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Two classes of QC-LDPC cycle codes approaching Gallager lower bound

  • 44 Accesses

This is a preview of subscription content, log in to check access.

References

  1. 1.

    Chen C, Bai B, Shi G, et al. Nonbinary LDPC codes on cages: structural property and code optimization. IEEE Trans Commun, 2015, 63: 364–375

  2. 2.

    Li J, Liu K, Lin S, et al. A matrix-theoretic approach to the construction of non-binary quasi-cyclic LDPC codes. IEEE Trans Commun, 2015, 63: 1057–1068

  3. 3.

    Zhao S, Huang X, Ma X. Structural analysis of arraybased non-binary LDPC codes. IEEE Trans Commun, 2016, 64: 4910–4922

  4. 4.

    Huang Q, Song L, Wang Z. Set message-passing decoding algorithms for regular non-binary LDPC codes. IEEE Trans Commun, 2017, 65: 5110–5122

  5. 5.

    Xu H, Chen C, Zhu M, et al. Nonbinary LDPC cycle codes: efficient search, design, and code optimization. Sci China Inf Sci, 2018, 61: 089303

  6. 6.

    Kim S, No J, Chung H, et al. Quasi-cyclic low-density parity-check codes with girth larger than 12. IEEE Trans Inform Theor, 2007, 53: 2885–2891

  7. 7.

    Tasdighi A, Banihashemi A H, Sadeghi M R. Efficient search of girth-optimal QC-LDPC codes. IEEE Trans Inform Theor, 2016, 62: 1552–1564

  8. 8.

    Chen C, Bai B, Wang X. Construction of nonbinary quasi-cyclic LDPC cycle codes based on singer perfect difference set. IEEE Commun Lett, 2010, 14: 181–183

  9. 9.

    Amirzade F, Sadeghi M R. Lower bounds on the lifting degree of QC-LDPC codes by difference matrices. IEEE Access, 2018, 6: 23688–23700

Download references

Author information

Correspondence to Hengzhou Xu or Hai Zhu.

Additional information

Acknowledgements

This work was supported in part by National Natural Science Foundation of China (Grant Nos. 61801527, 61701368, U1504601).

Supporting information

Appendixes A–C. The supporting information is available online at info.scichina.com and link.springer.com. The supporting materials are published as submitted, without typesetting or editing. The responsibility for scientific accuracy and content remains entirely with the authors.

Electronic supplementary material

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Xu, H., Li, H., Xu, M. et al. Two classes of QC-LDPC cycle codes approaching Gallager lower bound. Sci. China Inf. Sci. 62, 209305 (2019). https://doi.org/10.1007/s11432-018-9778-x

Download citation