Chapter

Applied Algebra, Algebraic Algorithms and Error-Correcting Codes

Volume 3857 of the series Lecture Notes in Computer Science pp 265-274

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

  • Ying Y. TaiAffiliated withDepartment of Electrical and Computer Engineering, University of California
  • , Lingqi ZengAffiliated withDepartment of Electrical and Computer Engineering, University of California
  • , Lan LanAffiliated withDepartment of Electrical and Computer Engineering, University of California
  • , Shumei SongAffiliated withDepartment of Electrical and Computer Engineering, University of California
  • , Shu LinAffiliated withDepartment of Electrical and Computer Engineering, University of California
  • , Khaled Abdel-GhaffarAffiliated withDepartment of Electrical and Computer Engineering, University of California

* Final gross prices may vary according to local VAT.

Get Access

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.