Skip to main content
SpringerLink
Log in

LDPC Codes Based on α-Resolvable Designs

  • Original Research
  • Published:
SN Computer Science Aims and scope Submit manuscript

Abstract

Earlier regular low-density parity-check (LDPC) codes have been constructed using resolvable combinatorial designs. Here we have constructed LDPC codes from α-resolvable (α > 1) designs which are generalization of resolvable designs. The LDPC codes obtained here from α-resolvable (α > 1) designs have much higher code rate in comparison to the earlier codes for the same code length but constructed from resolvable designs.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Data availability

Not applicable.

References

  1. Ammar B, Honary B, Kou Y. Construction of low-density parity-check codes based on balanced incomplete block designs. IEEE Trans Inf Theory. 2004;50(6):1257–68.

    Article  MathSciNet  MATH  Google Scholar 

  2. Assaf AM, Hartman A. Resolvable group divisible designs with block size 3. Discret Math. 1989;77:5–20.

    Article  MathSciNet  MATH  Google Scholar 

  3. Banerjee S, Kageyama S. Non-isomorphic solutions of group divisible designs with k = 3 and λ1 = 0. J Stat Plan Inference. 1996;56:23–32.

    Article  MathSciNet  MATH  Google Scholar 

  4. Clatworthy WH. Tables of two-associate-class partially balanced designs. Applied mathematics series, vol. 63. Gaithersburg: National Bureau of Standards (US); 1973.

    Google Scholar 

  5. Dey A. Incomplete block designs. New Delhi: Hindustan Book Agency; 2010.

    Book  MATH  Google Scholar 

  6. Diao Q, Tai Y, Lin S, Abdel-Ghaffar K. LDPC codes on partial geometries: construction, trapping set structure, and puncturing. IEEE Trans Inf Theory. 2013;59(12):7898–914.

    Article  MathSciNet  MATH  Google Scholar 

  7. Diao Q, Li J, Lin S, Blake IF. New classes of partial geometries and their associated LDPC codes. IEEE Trans Inf Theory. 2016;62(6):2947–65. https://doi.org/10.1109/TIT.2015.2508455.

    Article  MathSciNet  MATH  Google Scholar 

  8. Donovan D, Price A, Rao A, Üsküplü E, Yazici ES. High-rate LDPC codes from partially balanced incomplete block designs. J Algebraic Combin. 2022;55:259–75.

    Article  MathSciNet  MATH  Google Scholar 

  9. Furino S, Miao Y, Jianxing Y. Frames and resolvable designs: uses, constructions and existence. Boca Roca: Taylor & Francis Inc; 1996.

    MATH  Google Scholar 

  10. Gallager RG. Low-density parity-check codes. IEEE Trans Inf Theory. 1962;8:21–8.

    Article  MathSciNet  MATH  Google Scholar 

  11. Greig M. Designs from projective planes and PBD bases. J Combin Des. 1999;7:341–74.

    Article  MathSciNet  MATH  Google Scholar 

  12. John JA, Williams ER. Cyclic and computer generated designs. 2nd ed. London: Chapman and Hall; 1995.

    Book  MATH  Google Scholar 

  13. Johnson SJ, Weller SR (2001) Construction of low-density parity-check codes from Kirkman triple systems. In: Proceedings of IEEE Globecom conference, vol. 2. San Antonio; 2001. p. 970–74.

  14. Johnson SJ, Weller SR. Resolvable 2-design for regular low-density parity-check codes. IEEE Trans Commun. 2003;51(9):1413–9.

    Article  Google Scholar 

  15. Johnson SJ, Weller SR. Codes for iterative decoding from partial geometries. IEEE Trans Commun. 2004;52:236–43.

    Article  Google Scholar 

  16. Kageyama S. A Survey of resolvable solutions of balanced incomplete block designs. Int Stat Rev. 1972;1972(40):269–73.

    Article  MATH  Google Scholar 

  17. Kageyama S, Mohan RN. On μ-resolvable BIB designs. Discret Math. 1983;45:113–21.

    Article  MathSciNet  MATH  Google Scholar 

  18. Kou Y, Lin S, Fossorier MPC. Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans Inform Theory. 2001;47(7):2711–36.

    Article  MathSciNet  MATH  Google Scholar 

  19. Lan L, Tai Y, Lin S, Memari B, Honary B. New constructions of quasi–cyclic LDPC codes based on special classes of BIBDs for the AWGN and binary erasure channels. IEEE Trans Commun. 2008;56(1):39–48.

    Article  Google Scholar 

  20. Li X, Zhang XC, Shen J. Regular LDPC codes from semipartial geometries. Acta Appl Math. 2008;102(1):25–35.

    Article  MathSciNet  MATH  Google Scholar 

  21. Mahadevan A, Morris JM. On RCD SPC codes as LDPC codes based on arrays and their equivalence to some codes constructed from Euclidean geometries and partial BIBDs. Technical Reports No.: CSPLTR: 2002–1, Communication Signal Process Labview, CS and EE Department, University of Maryland; 2002.

  22. Mathon R, Rosa A. 2– (v, k, λ) designs of small order. In: Colbourn CJ, Dinitz JH, editors. Handbook of combinatorial designs. 2nd ed. New York: Chapman & Hall/CRC; 2007. p. 35–58.

    Google Scholar 

  23. Morgan JP, Reck BH. Resolvable designs with large blocks. Ann Stat. 2007;35(2):747–71.

    Article  MathSciNet  MATH  Google Scholar 

  24. Pei D. A survey of construction for A2-codes. In: Rosen KH, editor. Authentication codes and combinatorial designs. Discrete mathematics and its applications. New York: Chapman and Hall/CRC; 2006. p. 215–30.

    Chapter  Google Scholar 

  25. Patterson HD, Silvey V. Statutory and recommended list trials of crop varities in the United Kingdom. J R Stat Soc Ser A. 1980;143(3):219–52.

    Article  Google Scholar 

  26. Raghavarao D. Constructions and combinatorial problems in design of experiments. New York: Wiley; 1988.

    MATH  Google Scholar 

  27. Raghavarao D, Padgett LV. Block designs analysis, combinatorics and applications. Series on applied mathematics, vol 17. Singapore: World Scientific; 2005.

    MATH  Google Scholar 

  28. Saurabh S, Sinha K, Singh MK. A survey of resolvable solutions of partially balanced designs. Commun Stat Theory Methods. 2021. https://doi.org/10.1080/03610926.2021.1942049.

    Article  MATH  Google Scholar 

  29. Shan X, Li T. A construction of low-density parity-check codes. J Math Res Appl. 2013;33(3):330–6.

    MathSciNet  Google Scholar 

  30. Sun X, Ge G. Resolvable group divisible designs with block size four and general index. Discret Math. 2009;309:2982–9.

    Article  MathSciNet  MATH  Google Scholar 

  31. Vasic BV, Milenkovic O. Combinatorial constructions of low–density parity–check codes for iterative decoding. IEEE Trans Inf Theory. 2004;50(6):1156–1176

    Article  MathSciNet  MATH  Google Scholar 

  32. Vasic B, Kurtas EM, Kuznetsov AV. LDPC codes based on mutually orthogonal latin rectangles and their application in perpendicular magnetic recording. IEEE Trans Magn. 2002;38:2346–8.

    Article  Google Scholar 

  33. Weller SR, Johnson SJ. Regular low-density parity-check codes from oval designs. Eur Trans Telecommun. 2003;14:399–409.

    Article  Google Scholar 

  34. Xu H, Feng D, Sun C, Bai B. Construction of LDPC codes based on resolvable group divisible designs. International workshop on high mobility wireless communications (HMWC). 2015. pp. 111–15. https://doi.org/10.1109/HMWC.2015.7354346

  35. Xu H, Yu Z, Feng D, Zhu H. New construction of partial geometries based on group divisible designs and their associated LDPC codes. Phys Commun. 2019. https://doi.org/10.1016/j.phycom.2019.100970.

    Article  Google Scholar 

  36. Zhang L, Huang Q, Lin S, Abdel-Ghaffar A, Blake IF. Quasi-cyclic LDPC codes: an algebraic construction, rank analysis and codes on Latin squares. IEEE Trans Commun. 2010;58(11):3126–39.

    Article  Google Scholar 

Download references

Acknowledgements

The authors are thankful to the referee for valuable suggestions in improving the presentation of the paper.

Author information

Author notes

  1. Kishore Sinha

    Present address: , 201 Maitry Residency, Kalkere Main Road, Bangalore, 560043, India

Authors and Affiliations

  1. Tata College, Kolhan University, Chaibasa, 833202, India

    Shyam Saurabh

  2. Birsa Agricultural University, Ranchi, India

    Kishore Sinha

Authors
  1. Shyam Saurabh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kishore Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shyam Saurabh.

Ethics declarations

Conflict of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Saurabh, S., Sinha, K. LDPC Codes Based on α-Resolvable Designs. SN COMPUT. SCI. 4, 617 (2023). https://doi.org/10.1007/s42979-023-02088-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s42979-023-02088-2

Keywords

Search

Navigation