Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: A finite geometry approach

IEEE Transactions on Communications

Volumn 56, Issue 3, 2008, Pages 378-387

  Zeng, Lingqi ^a   Lan, Lan ^b,c   Tai, Ying Yu ^a,d   Zhou, Bo ^a   Lin, Shu ^a   Abdel Ghaffar, Khaled A S ^a  

^a Link A Media Devices Corporation   (United States)

^b University of California Davis   (United States)

^c KeyEye Communications   (United States)

^d Ikanos Communications Inc   (United States)

Author keywords

Berlekamp Massey algorithm; Euclidean geometry; Incidencevector; K tter Vardy algebraic soft decision algorithm; LDPC code; Location vector

Indexed keywords

ALGEBRA; BAYESIAN NETWORKS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; ITERATIVE DECODING; REED-SOLOMON CODES;

BERLEKAMP-MASSEY ALGORITHM; EUCLIDEAN GEOMETRY; FINITE GEOMETRY; LOW-DENSITY PARITY CHECK CODE;

ENCODING (SYMBOLS);

EID: 41849129577     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2008.060025     Document Type: Article

References (28)

1. L.-Q. Zeng, L. Lan, Y.Y. Tai, S. Lin, and K. Abdel-Ghaffar, "Construction of nonbinary quasi-cyclic LDPC codes: A finite field approach," to appear in the April 2008 issue of IEEE Trans. Commun.
2. Y. Kou, S. Lin, and M. Fossorier, "Low density parity check codes base on finite geometries: A rediscovery and new Results," IEEE Trans. Inform. Theory, vol. 47, no. 11, pp. 2711-2736, Nov. 2001.
3. L. Chen, J. Xu, I. Djurdjevic, and S. Lin, "Near Shannon limit quasicyclic low-density parity-check codes," IEEE Trans. Commun., vol. 52, no. 7, pp. 1038-1042, July 2004.
4. H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar, "On algebraic construction of Gallager and circulant low density parity check codes," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1269-1279, June 2004.
5. H. Tang, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Codes on finite geometries," IEEE Trans. Inform. Theory, vol. 51, no. 2, pp 572-596, Feb. 2005.
6. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, IT-8, pp. 21-28, Jan. 1962.
7. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
8. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-432, Mar. 1999.
9. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
10. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, Sept. 1981.
11. F. R. Kschinschang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519. Feb. 2001.
12. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory vol. 47, pp. 599-618, Feb. 2001.
13. S. Y Chung, T. Richardson, and R. Urbanke, "Analysis of sumproduct decoding of low-density parity-check codes using guassian approximation," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
14. M. Davey and D. J. C. MacKay, "Low density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, June 1998.
15. D. J. C. MacKay and M. C. Davey, "Evaluation of Gallager codes of short block length and high rate applications," in Proc. IMA International Conference on Mathematics and Its Applications: Codes, Systems and Graphical Models, pp. 113-130, Springer-Verlag, New York, 2000.
16. q)," in Proc. ITW2003, pp. 70-73, Paris, France, March 2003.
17. D. Declercq and M. Fossorier, "Decoding algorithms for nonbinary LDPC codes over GF(q)," to appear in IEEE Trans. Commun., 2007.
18. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd edition. Upper Saddle River, NJ: Prentice Hall, 2004.
19. Z.-W. Li, L. Chen, L.-Q. Zeng, S. Lin, and W. Fong, "Efficient encoding of quasi-cyclic low-density parity-check codes," IEEE Trans. Commun. vol. 54, pp. 71-81, Jan. 2006.
20. H. B. Mann, Analysis and Design of Experiments. New York: Dover, 1949.
21. R. D. Carmichael, Introduction to the Theory of Groups of Finite Order. New York: Dover, 1956.
22. E. R. Berlekamp, Algebraic Coding Theory, New York: McGraw-Hill, 1968.
23. C. Shannon, R. Gallager, and E. Berlekamp, "Lower bounds to error probability for decoding on discrete memoryless channels," Inform. and Control, vol. 10, part 1, pp. 65-103, and part 2: Pp. 522-552, Feb./May 1967.
24. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. 15, no. 1, pp. 122-127, 1969.
25. R. Kötter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 49, no. 11, pp. 2809-2825, Nov. 2003.
26. M. El-Khamy and R. McEliece, "Iterative algebraic soft-decision list decoding of RS codes," IEEE J. Select. Areas Commun., vol. 24, pp. 481-490, Mar. 2006.
27. W. J. Gross, F. R. Kschischang, R. Kötter, and P. G. Gulak, "Applications of algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 54, no. 7, pp. 1224-1234, July 2006.
28. J. Xu, L. Chen, I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, "Construction of regular and irregular LDPC codes: Geometry decomposition and masking," IEEE Trans. Inform. Theory, vol.53, no. 1, pp. 121-134, Jan. 2007.