On algebraic construction of Gallager and circulant low-density parity-check codes

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 1269-1279

  Tang, Heng ^a   Xu, Jun ^b   Kou, Yu ^c   Lin, Shu ^d   Abdel Ghaffar, Khaled ^d  

^a PMC Sierra Inc   (United States)

^b UNIVERSITY OF NOTRE DAME   (United States)

^c MARVELL SEMICONDUCTOR INC   (United States)

^d University of California   (United States)

Author keywords

Cyclic code; Euclidean geometry; Projective geometry; Quasi cyclic code; Sum product algorithm (SPA)

Indexed keywords

ALGEBRA; ALGORITHMS; ELECTRIC NETWORK ANALYSIS; GEOMETRY;

CIRCULANT; GALLAGER;

CODES (SYMBOLS);

EID: 2942640145     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.828088     Document Type: Letter

References (35)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-18, pp. 21-28, Jan. 1962.
2. ____, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
3. 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, 1996.
4. M. Sipser, and D. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, Nov. 1996.
5. D. Spielman, "Linear-time encodable error-correctable codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1723-1731, Nov. 1996.
6. M. C. Davey and D. J. C. MacKay, "Low density parity check codes over GF (q)," IEEE Commun. Lett., vol. 2, pp. 165-167, June 1998.
7. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs and belief propagation," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, Feb. 2001.
8. D. J. C. MacKay, "Gallager codes that are better than turbo codes," in Proc. 36th Allerton Conf. Communications, Control, and Computing, Monticello, IL, Sept. 23-25, 1998.
9. ____, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-432, Mar. 1999.
10. S. Y. Chung, G. D. Forney, Jr., T. J. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, pp. 58-60, Feb. 2001.
11. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under massage-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
12. T. J. Richardson, M. A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
13. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
14. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. Int. Conf. Communications (ICC'93), Geneva, Switzerland, May 1993, pp. 1064-1070.
15. N. Wilberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Europ. Trans. Telecommun., vol. 6, pp. 513-525, 1995.
16. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's belief propagation algorithm," IEEE J. Select. Areas Commun., vol. 16, pp. 140-152, Feb. 1998.
17. R. Lucas, M. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, pp. 931-937, Jun. 2000.
18. 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.
19. J. Rosenthal and P. O. Vontobel, "Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. 2001 IEEE Int. Symp. Information Theory (ISIT'01), Washington, DC, June 2001, p. 4.
20. I. Djurdjevic, S. Lin, and K. Abdel-Ghaffar, "Graph-theoretic construction of low density parity check codes," IEEE Commun. Lett., vol. 7, pp. 171-173, Apr. 2003.
21. Y. Kou, J. Xu, H. Tang, S. Lin, and K. Abdel-Ghaffar, "On circulant low density parity check codes," in Proc. IEEE Int. Symp. Information Theory (ISIT'02), Lausanne, Switzerland, June/July 2002, p. 200.
22. H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar, "On algebraic construction of Gallager low density parity check codes," in Proc. IEEE Int. Symp. Information Theory (ISIT'02), Lausanne, Switzerland, June/July 2002, p. 482.
23. S. Lin, H. Tang, and Y. Kou, "On a class of finite geometry low density parity check codes," in Proc. 2001 IEEE Int. Symp. Information Theory (ISIT'01), Washington, DC, June 2001, p. 2.
24. B. Ammar, B. Honary, Y. Kou, and S. Lin, "Construction of low density parity check codes: A combinatoric design approach," in Proc. IEEE Int. Symp. Information Theory (ISIT'02), Lausanne, Switzerland, June/July 2002, p. 311.
25. B. Ammar, B. Honary, Y. Kou, J. Xu, and S. Lin, "Construction of low-density parity-check codes based on balanced incomplete block designs," IEEE Trans. Inform. Theory, vol. 50, pp. 1257-1268, June 2004.
26. B. Vasić, "Combinatorial construction of low-density parity-check codes for iterative decoding," IEEE Trans. Inform. Theory, vol. 50, pp. 1156-1176, June 2004.
27. S. Sankaranarayanan, B. Vasić, and E. M. Kurtas, "A systematic construction of irregular low-density parity-check codes from combinatorial designs," in Proc. IEEE Int. Symp. Information Theory (ISIT'03), Yokohama, Japan, 2003, p. 1.
28. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, 1981.
29. J. L. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
30. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
31. H. B. Mann, Analysis and Design of Experiments. New York: Dover, 1949.
32. R. D. Carmichael, Introduction to the Theory of Groups of Finite Orders. New York: Dover, 1956.
33. A. P. Street and D. J. Street, Combinatorics of Experimental Designs. Oxford, UK: Oxford Sci., Clarendon, 1987.
34. D. J. C. MacKay, private communication.
35. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.