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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
Hu, X.-Y., Eleftheriou, E., Arnold, D.-M.: Progressive edge-growth Tanner graphs. In: Proc. IEEE GLOBECOM, San Antonio, TX (November 2001)
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)
Richardson, T., Shokrollahi, A., Urbanke, R.: Design of capacity-approaching low desnsity parity-check codes. IEEE Trans. Inform. Theory 47, 619–637 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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)