Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes

AAECC 2006: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes pp 275–284Cite as

New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary Erasure Channels

  • Conference paper

  • 1015 Accesses

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

Abstract

This paper presents two new methods for constructing quasi-cyclic LDPC codes using certain special classes of balanced incomplete block designs constructed based on finite fields. The codes constructed perform well with iterative decoding over both AWGN and binary erasure channels.

This is a preview of subscription content, 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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bose, R.C.: On the construction of balanced incomplete designs. Ann. Eugenics 9, 353–399 (1939)

    MathSciNet  Google Scholar 

  2. Mann, H.B.: Analysis and Design of Experiments. Dover Publishers, New York (1949)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Ammar, B., Honary, B., Kou, Y., Xu, J., Lin, S.: Construction of low density parity-check codes based on balanced imcomplete block designs. IEEE Trans. Inform. Theory 50(6), 1257–1268 (2004)

    Article  MathSciNet  Google Scholar 

  5. Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inform. Theory 27, 533–547 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  6. MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory 45, 399–432 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Richardson, T., Urbanke, R.: The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory 47, 599–618 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Kschinschang, F.R., Frey, B.J., Loeliger, H.-A.: Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory 47, 498–519 (2001)

    Article  MathSciNet  Google Scholar 

  9. Li, Z.-W., Chen, L., Lin, S., Fong, W., Yeh, P.-S.: Efficient encoding of quasi-cyclic low-density parity-check codes. IEEE Trans. Commun (2005) (accepted)

    Google Scholar 

  10. Chen, L., Xu, J., Djurdjevic, I., Lin, S.: Near Shannon limit quasi-cyclic low-density parity-check codes. IEEE Trans. Commun. 52(7), 1038–1042 (2004)

    Article  Google Scholar 

  11. Tang, H., Xu, J., Kou, Y., Lin, S., Abdel-Ghaffar, K.: On algebraic construction of Gallager and circulant low density parity-check codes. IEEE Trans. Inform. Theory 50(6), 1269–1279 (2004)

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  13. Chen, L., Lan, L., Djurdjevic, I., Lin, S., Abdel-Ghaffar, K.: An algebraic method for constructing quasi-cyclic LDPC codes. In: Proc. Int. Symp. Inform. Theory and Its Applications, ISITA 2004, Parma, Italy, October 10-13, pp. 535–539 (2004)

    Google Scholar 

  14. Xu, J., Chen, L., Zeng, L., Lan, L., Lin, S.: Construction of low-density parity-check codes by superposition. IEEE Trans. Commun. 53(2), 243–251 (2005)

    Article  Google Scholar 

  15. Kou, Y., Lin, S., Fossorier, M.: Low density parity-check codes based on finite geometries: a discovery and new results. IEEE Trans. Inform. Theory 47, 2711–2736 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lin, S., Costello Jr., D.J.: Error Control Coding: Fundamentals and Applications, 2nd edn. Prentice Hall, Upper Saddle River (2004)

    Google Scholar 

  17. Tanner, R.M.: Spectral graphs for quasi-cyclic LDPC codes. In: Proc. IEEE int. Symp. on Inform. Theory, Washington D.C., June 24-29, p. 226 (2001)

    Google Scholar 

  18. Di, C., Proietti, D., Teletar, I.E., Richarson, T.J., Urbanke, R.L.: Finite length analysis of low-density parity-check codes on binary erasure channel. IEEE Trans. Inform. Theory 48(6), 1570–1579 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  19. Orlitsky, A., Urbanke, R.L., Viswanathan, K., Zhang, J.: Stopping sets and the girth of Tanner graph. In: Proc. Int. Symp. Inform. Theory, Lausanne, Switzerland, June 30-July 5, p. 2 (2002)

    Google Scholar 

  20. Djurdjevic, I., Xu, J., Abdel-Ghaffar, K., Lin, S.: Construction of low-density parity-check codes based on shortened Reed-Solomon codes with two information symbols. IEEE Commun. Lett. (7), 317–319 (July 2003)

    Article  Google Scholar 

  21. Richardson, T.: Error floors of LDPC codes. In: Proc. Allerton Conf. on Communication, Control and computing, Monticello, IL, October 2003, pp. 1426–1435 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Lan Lan, Ying Yu Tai & Shu Lin

  2. Department of Communication Engineering, Lancaster University, Lancaster, LA14YW, UK

    Behshad Memari & Bahram Honary

Authors
  1. Lan Lan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Yu Tai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shu Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Behshad Memari
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Bahram Honary
    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

Lan, L., Tai, Y.Y., Lin, S., Memari, B., Honary, B. (2006). New Constructions of Quasi-cyclic LDPC Codes Based on Two Classes of Balanced Incomplete Block Designs: For AWGN and Binary 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_27

Download citation

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

  • 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

Search

Navigation