Abstract
This paper is the first part of a sequence of two papers that present algebraic constructions of quasi-cyclic LDPC codes for AWGN, binary random and burst erasure channels. In this paper, a class of quasi-cyclic LDPC codes for both AWGN and binary random erasure channels is constructed based on finite fields and special vector representations of finite field elements.
This research was supported by NASA under the Grant NNG05GD13G and NSF under the Grant CCR-0117891 and ECS-0121469.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Gallager, R.G.: Low density parity-check codes. IRE Trans. Inform. Theory IT-8, 21–28 (1962)
MacKay, D.J.C., Neal, R.M.: Near Shannon limit performance of low density parity-check codes. Electro. Lett. 32, 1645–1646 (1996)
MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory 45, 399–432 (1999)
Richardson, T., Urbanke, R.: The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory 47, 599–618 (2001)
Richardson, T., Shokrollahi, A., Urbanke, R.: Design of capacity-approaching low desnsity parity-check codes. IEEE Trans. Inform. Theory 47, 619–637 (2001)
Tanner, R.M.: A recursive approach to low complexity codes. IEEE Trans. Inform. Theory 27, 533–547 (1981)
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)
Johnson, S.J., Weller, S.R.: Codes for iterative decoding from partial geometries. IEEE Trans. Commun. 52(2), 236–247 (2003)
Djurdjevic, I., Xu, J., Abdel-Ghaffar, K., Lin, S.: Construction of low-density parity-check codes based on Reed-Solomon codes with two information symbols. IEEE Commun. Lett. 7(7), 317–319 (2003)
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)
Vasic, B., Milenkovic, O.: Combinatorial construction of low density parity-check codes for iterative decoding. IEEE Trans. Inform. Theory 50(6), 1156–1176 (2004)
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)
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)
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)
Tang, H., Xu, J., Lin, S., Abdel-Ghaffar, K.: Codes on finite geometries. IEEE Trans. Inform. Theory 51(2), 572–596 (2005)
Xu, J., Chen, L., Zeng, L.-Q., Lan, L., Lin, S.: Construction of low-density parity-check codes by superposition. IEEE Trans. Commun. 53(2), 243–251 (2005)
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)
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)
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)
Tian, T., Jones, C., Villasensor, J.D., Wesel, R.D.: Construction of irregular LDPC codes with low error floors. In: IEEE ICC 2003 Int. Conf. on Commun., pp. 3125–3129 (2003)
Richardson, T.: Error floors of LDPC codes. In: Proc. Allerton Conf. on Communication, Control and Computing, Monticello, IL, October 2003, pp. 1426–1435 (2003)
Lin, S., Costello Jr., D.J.: Error Control Coding: Fundamentals and Applications, 2nd edn. Prentice Hall, Upper Saddle River (2004)
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
Lan, L., Zeng, L., Tai, Y.Y., Chen, L., Lin, S., Abdel-Ghaffar, K. (2006). Algebraic Constructions of Quasi-cyclic LDPC Codes – Part I: For AWGN and Binary Random 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_25
Download citation
DOI: https://doi.org/10.1007/11617983_25
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)