Constructions of nonbinary quasi-cyclic LDPC codes: A finite field approach

IEEE Transactions on Communications

Volumn 56, Issue 4, 2008, Pages 545-554

  Zeng, Lingqi ^a   Lan, Lan ^b   Tai, Ying Y ^c   Song, Shumei ^d   Lin, Shu ^e   Abdel Ghaffar, Khaled ^e  

^a Link A Media Devices Corporation   (United States)

^b KeyEye Communications   (United States)

^c Ikanos Communications   (United States)

^d MARVELL SEMICONDUCTOR INC   (United States)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Berlekamp Massey algorithm; Dispersion; K tter Vardy algorithm; Location vector; Quasi cyclic LDPC code; Superposition

Indexed keywords

BOOLEAN ALGEBRA; CODES (STANDARDS); COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; FAST FOURIER TRANSFORMS; FOURIER TRANSFORMS; ITERATIVE DECODING; ITERATIVE METHODS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; PROGRAMMING THEORY; REED-SOLOMON CODES;

BERLEKAMP-MASSEY ALGORITHM; BERLEKAMP-MASSEY ALGORITHMS; CODING GAINS; DISPERSION; FINITE FIELDS; FOURIER; LOCATION-VECTOR; QUASI-CYCLIC LDPC CODE; QUASI-CYCLIC LDPC CODES; SUM-PRODUCT ALGORITHM; SUPERPOSITION;

CODES (SYMBOLS);

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

References (26)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, IT-8, pp. 21-28, Jan. 1962.
2. 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.
3. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-432, Mar. 1999.
4. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
5. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, Sept. 1981.
6. F. R. Kschischang, 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.
7. 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.
8. S. Y. Chung, T. Richardson, and R. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using Gaussian approximation," IEEE Trans. Inform. Theory, vol. 47, pp. 657-670, Feb. 2001.
9. Y. Kou, S. Lin, and M. Fossorier, "Low density parity check codes based on finite geometries: A discovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
10. 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.
11. 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 Graphincal Models, pp. 113-130, Springer-Verlag, New York, 2000.
12. L. Barnault and D. Declercq, "Fast decoding algorithm for LDPC over GF(2q)," in Proc. ITW2003, pp. 70-73, Paris, France, Mar. 2003.
13. D. Declercq and M. Fossorier, "Decoding algorithms for nonbinary LDPC codes over GF(q)," submitted to IEEE Trans. Commun., 2005.
14. 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.
15. A. Hocquenghem, "Codes corecteurs d'erreurs," Chiffres, vol. 2, pp. 147-156, 1959
16. R. C. Bose and D. K. Ray-Chaudhuri, "On a class of error-correcting binary group codes," Inform. Control, vol. 3, pp. 68-79, Mar. 1960.
17. I. S. Reed and G. Solomon, "Polynomial code over certain finite fields," J. Soc. Ind. Appl. Math., vol. 8, pp. 300-304, June 1960.
18. L.-Q. Zeng, L. Lan, Y. Y. Tai, S. Song, and S. Lin, "Quasi-cyclic codes for AWGN and binary erasure channels: Construction based on finite fields and affine permutations," in Proc. 8th International Symposium on Communication Theory and Applications, Ambleside, UK, July 2005.
19. L. Lan, L.-Q. Zeng, Y. Y. Tai, S. Lin, and K. Abdel-Ghaffar, "Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings," in Proc. IEEE International Symposium on Information Theory, Adelaide, Australia, Sept. 2005, and also submitted to IEEE Trans. Inform. Theory, 2006.
20. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd edition. Prentice Hall, 2004.
21. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
22. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. 15, no. 1, pp. 122-127, Jan. 1969.
23. 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.
24. 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.
25. W. J. Gross, F. R. Kschischang, R. Kotter, and G. G. Gulak, "Applications of algebraic soft-decision decoding of RS codes," IEEE Trans. Commun., vol. 54, no. 7, pp. 1224-1234, July 2006.
26. J. Xu, L. Chen, L.-Q. Zeng, L. Lan, and S. Lin, "Construction of low-density parity-check codes by superposition," IEEE Trans. Commun vol. 53, no. 2, pp. 243-251, Feb. 2005.