Explicit construction of families of LDPC codes with no 4-cycles

IEEE Transactions on Information Theory

Volumn 50, Issue 10, 2004, Pages 2378-2388

  Kim, Jon Lark ^a   Peled, Uri N ^b   Perepelitsa, Irina ^b   Pless, Vera ^b   Friedland, Shmuel ^b  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DECODING; GRAPH THEORY; MATRIX ALGEBRA; THEOREM PROVING; TURBO CODES;

CODE CONSTRUCTION; LARGE GIRTH; LOW DENSITY PARITY CHECK CODES; TANNER GRAPH;

BINARY CODES;

EID: 5144223774     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.834760     Document Type: Article

References (17)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Infom. Theory, vol. 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, no. 18, pp. 1645-1646, 1996.
3. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
4. F. Lazebnik and V. A. Ustimenko, "Explicit construction of graphs with arbitrary large girth and of large size," Discr. Appl. Math., vol. 60, pp. 275-284, 1997.
5. F. Lazebnik and A. J. Woldar, "General properties of some families of graphs defined by systems of equations," J. Graph Theory, vol. 38, pp. 65-86, 2001.
6. R. Viglione, "Properties of some algebraically defined graphs," Ph.D. dissertation, Univ. Delaware, Newark, 2002.
7. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Infom. Theory, vol. 48, pp. 1570-1579, June 2002.
8. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, 2000, pp. 543-546.
9. B. Vasic, "A class of codes with orthogonal parity checks and its application in partial response channels with iterative decoding," in Proc. 40th Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 2-4, 2002.
10. O. Milenkovic, K. Prakash, and B. Vasic, "Regular and irregular low density parity check codes for iterative decoding based on cycle-in-variant difference sets," in Proc. 41st Allerton Conf. Communication, Control and Computing, Monticello, IL, Oct. 1-3, 2003.
11. J.-L. Kim, U. N. Peled, I. Perepelitsa, and V. Pless, "Explicit construction of families of LDPC codes of girth at least six," in Proc. 40th Allerton Conf. Communication, Control and Computing, P. G. Voulgaris and R. Srikant, Eds., Monticello, IL, Oct. 2-4, 2002, pp. 1024-1031.
12. E. F. Assmus Jr. and J. D. Key, Designs and Their Codes. Cambridge, U.K.: Cambridge Univ. Press, 1992.
13. W. C. Huffman and V. Pless, Fundamentals of Error-Correcting Codes. Cambridge, U.K.: Cambridge Univ. Press, 2003.
14. Y. Kou, S. Lin, and M. P. C. 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.
15. J. Cannon and C. Playoust, An Introduction to Magma. Sydney, Australia: Univ. Sydney Press, 1994.
16. A. E. Brouwer, "Bounds on the size of linear codes," in Handbook of Coding Theory, V. S. Pless and W. C. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998, pp. 295-452.
17. M. P. C. Fossorier and S. Lin, "Soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inform. Theory, vol. 41, pp. 1379-1396, Sept. 1995.