Skip to main content
SpringerLink
Log in

LDPC Code Construction from Bipartite Kneser Graphs

  • Conference paper
  • First Online:
Book cover Proceedings of the 2nd International Conference on Communication, Devices and Computing (ICCDC 2019)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 602))

Included in the following conference series:

Abstract

Low density Parity Check (LDPC) codes show excellent characteristics in error correction. It is extensively used in the majority of the modern communication systems. Construction of LDPC code is a challenging task. In the present work, LDPC codes construction is attempted from bipartite Kneser graphs. This is the first time that Kneser graphs are used to construct LDPC codes. A special matrix consisting of very few entries of 1 is used in conjunction with the bipartite Kneser graphs to yield the final LDPC matrix. The codes obtained can be encoded by an approximate lower triangular technique. Also, the codes are four-cycle free, thus giving improved bit error rate performance. The code length and data rate of the codes obtained by the proposed method can be easily altered by choosing the parameters of the Kneser graph suitably.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gallager, R.G.: Low-density parity-check codes. IRE Trans. Inf. Theory 8(1), 21–28 (1962)

    Google Scholar 

  2. Davey, M.C., MacKay, D.J.C.: Low density parity check codes over GF (q). In: IEEE Information Theory Workshop, pp. 70–71 (1998)

    Google Scholar 

  3. MacKay, D.J.C., Neal, R.M.: Near Shannon limit performance of low density parity check codes. Electron. Lett. 32(18), 1645–1646 (1996)

    Article  ADS  Google Scholar 

  4. Li, J., Liu, K., Lin, S., Abdel-Ghaffar, K.: Algebraic quasi-cyclic LDPC codes: construction, low error-floor, large girth and a reduced-complexity decoding scheme. IEEE Trans. Commun. 62(8), 2626–2637 (2014)

    Article  Google Scholar 

  5. Paolini, E., Fossorier, M.P., Chiani, M.: Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel. IEEE Trans. Inf. Theory 56(4), 1651–1672 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  6. Han, W., Huang, J.: A block-PEG construction method for LDPC codes. In: IEEE 4th International Conference on Electronics Information and Emergency Communication (ICEIEC), 2013, pp. 274–277 (2013)

    Google Scholar 

  7. Liu, K., El-Khamy, M., Lee, J.: Finite-length algebraic spatially-coupled quasi-cyclic LDPC codes. IEEE J. Sel. Ares Commun. 34(2), 329–344 (2016)

    Article  Google Scholar 

  8. Khodaiemehr, H., Kiani, D.: Construction and encoding of QC-LDPC codes using group rings. IEEE Trans. Inf. Theory 63(4), 2039–2060 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bocharova, I.E., Hug, F., Johannesson, R., Kudryashov, B.D., Satyukov, R.V.: Some voltage graph-based LDPC tailbiting codes with large girth. In: IEEE International Symposium on Information Theory (ISIT), 2011, pp. 732–736 (2011)

    Google Scholar 

  10. Malema, G., Liebelt, M.: High girth column-weight two LDPC codes based on distance graphs. EURASIP J. Wirel. Commun. Netw. 2007(1), 6–6 (2007)

    Article  MATH  Google Scholar 

  11. Couvreur, A., Delfosse, N., Zmor, G.: A construction of quantum LDPC codes from Cayley Graphs. IEEE Trans. Inf. Theory 59(9), 6087–6098 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  12. Samadieh, M., Gholami, M.: Double Cylinder Cycle codes of Arbitrary Girth (2014). arXiv:1403.0804v1 [cs.IT]

  13. Richardson, T., Urbanke, R.: Modern Coding Theory. Cambridge University Press (2008)

    Google Scholar 

  14. Liu, X., Yuanbin, Z., Cui, R.: Variable-node-based dynamic scheduling strategy for belief-propagation decoding of LDPC codes. IEEE Commun. Lett. 19(2), 147–150 (2015)

    Article  Google Scholar 

  15. Babar, Z., Botsinis, P., Alanis, D., Ng, S.X., Hanzo, L.: Construction of quantum LDPC codes from classical row-circulant QC-LDPCs. IEEE Commun. Lett. 20(1), 9–12 (2016)

    Article  Google Scholar 

  16. Pramanik, A., Sarkar, S., Maity, S.P.: Performance Comparison of Orthogonal Complex MIMO STBC with ML Decoding and Soft Decision Decoding, accepted & presented in WISPNET (2017)

    Google Scholar 

  17. Pramanik, A., Farheen, Z., Maity, S.P.: On compressed sensing based channel estimation in massive MIMO. In: IEEE(EDS) Sponsored 5th International Conference on Computing. Communication and Sensor Network, Kolkata (2016)

    Google Scholar 

  18. Godsil, C., Royele, G.: Algebraic Graph Theory, vol. 207. Springer Science & Business Media, New York (2013)

    Google Scholar 

  19. Bose, R.: Information Theory, Coding and Cryptography. Tata McGraw-Hill Education (2008)

    Google Scholar 

  20. McKay, D.: Inference group home page. http://www.inference.org.uk/mackay/codes/data.html

Download references

Author information

Authors and Affiliations

  1. Electronics and Electrical Communication Engineering Department, Indian Institute of Technology, Kharagpur, Kharagpur, India

    Tamal Chowdhury

  2. Electronics and Telecommunication Engineering Department, Indian Institute of Engineering Science and Technology, Shibpur, Shibpur, India

    Ankita Pramanik

Authors
  1. Tamal Chowdhury
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ankita Pramanik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tamal Chowdhury .

Editor information

Editors and Affiliations

  1. Department of Electronics and Communication Engineering, National Institute of Technology Durgapur, Durgapur, West Bengal, India

    Sumit Kundu

  2. Department of Electronics and Communication Engineering, National Institute of Technology Karnataka, Mangalore, Karnataka, India

    U. Shripathi Acharya

  3. Department of Electronics and Communication Engineering, Haldia Institute of Technology, Haldia, West Bengal, India

    Chanchal Kr. De

  4. Department of Electronics and Communication Engineering, Haldia Institute of Technology, Haldia, West Bengal, India

    Surajit Mukherjee

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chowdhury, T., Pramanik, A. (2020). LDPC Code Construction from Bipartite Kneser Graphs. In: Kundu, S., Acharya, U.S., De, C.K., Mukherjee, S. (eds) Proceedings of the 2nd International Conference on Communication, Devices and Computing. ICCDC 2019. Lecture Notes in Electrical Engineering, vol 602. Springer, Singapore. https://doi.org/10.1007/978-981-15-0829-5_1

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-0829-5_1

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-0828-8

  • Online ISBN: 978-981-15-0829-5

  • eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)

Publish with us

Policies and ethics

Search

Navigation