Skip to main content
Springer Nature Link
Log in

Algebraic Construction of Quasi-cyclic LDPC Codes – Part II: For AWGN and Binary Random and Burst Erasure Channels

  • Conference paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3857))

  • 1099 Accesses

Abstract

This paper is the second part of a sequence of two papers that present several algebraic methods for constructing quasi-cyclic (QC) LDPC codes for AWGN, binary random and burst erasure channels. In the first paper, we presented a class of QC-LDPC codes for both the AWGN and binary random erasure channels. The construction of this class of QC-LDPC codes is based on finite fields and location vector representations of finite field elements. In this paper, we presented two other algebraic methods for constructing QC-LDPC codes for the AWGN, binary random and burst erasure channels.

This research was supported by NASA under the Grant NNG05GD13G and NSF under the Grant CCR-0117891 and ECS-0121469.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Lan, L., Zeng, L., Tai, Y.Y., Chen, L., Lin, S.: Algebraic Construction of Quasi-Cyclic LDPC Codes - Part I: For AWGN and Binary Random Erasure Channels. In: The proceedings of the 16th Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Las Vegas, Nevada, February 20-24. Springer, Heidelberg (2006)

    Google Scholar 

  2. Xu, J., Chen, L., Djurdjevic, I., Lin, S., Abdel-Ghaffar, K.: Construction of regular and irregular LDPC codes: geometry decomposition and masking. Submitted to IEEE Trans. Inform. Theory (2004) (in revision)

    Google Scholar 

  3. Chen, L., Djurdjevic, I., Xu, J., Lin, S., Abdel-Ghaffar, K.: Construction of QC-LDPC codes based on the minimum-weight codewords of Reed-Solomon codes. In: Proc. IEEE Int. Symp. Inform. Theory, Chicago, IL, June 27-July 2, p. 239 (2004)

    Google Scholar 

  4. Hu, X.-Y., Eleftheriou, E., Arnold, D.-M.: Progressive edge-growth Tanner graphs. In: Proc. IEEE GLOBECOM, San Antonio, TX (November 2001)

    Google Scholar 

  5. Lan, L., Tai, Y.Y., Chen, L., Lin, S., Abdel-Ghaffar, K.: A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes. IEEE Commun. Lett. 8(7), 443–445 (2004)

    Article  Google Scholar 

  6. Richardson, T., Shokrollahi, A., Urbanke, R.: Design of capacity-approaching low desnsity parity-check codes. IEEE Trans. Inform. Theory 47, 619–637 (2001)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of California, Davis, CA, 95616, USA

    Ying Y. Tai, Lingqi Zeng, Lan Lan, Shumei Song, Shu Lin & Khaled Abdel-Ghaffar

Authors
  1. Ying Y. Tai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lingqi Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lan Lan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shumei Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Shu Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Khaled Abdel-Ghaffar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, University of Hawaii, Honolulu, USA

    Marc P. C. Fossorier

  2. National Institute of Advanced Industrial Science and Technology (AIST), Research Center for Information Security (RCIS),  

    Hideki Imai

  3. Department of Electrical and Computer Engineering, University of California, CA 95616, Davis,  

    Shu Lin

  4. University Paul Sabatier, AAECC/IRIT, 118 route de Narbonne, 31300, Toulouse cedex, France

    Alain Poli

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tai, Y.Y., Zeng, L., Lan, L., Song, S., Lin, S., Abdel-Ghaffar, K. (2006). Algebraic Construction of Quasi-cyclic LDPC Codes – Part II: For AWGN and Binary Random and Burst Erasure Channels. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2006. Lecture Notes in Computer Science, vol 3857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617983_26

Download citation

  • DOI: https://doi.org/10.1007/11617983_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-31423-3

  • Online ISBN: 978-3-540-31424-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics