Algebraic construction of sparse matrices with large girth

IEEE Transactions on Information Theory

Volumn 52, Issue 2, 2006, Pages 718-727

  O'Sullivan, Michael E ^a  

^a SAN DIEGO STATE UNIVERSITY   (United States)

Author keywords

Bipartite graph; Low density parity check (LDPC) codes

Indexed keywords

CODING ERRORS; DECODING; ERROR CORRECTION; GRAPH THEORY; MATRIX ALGEBRA; POLYNOMIALS;

ALGEBRAIC CONSTRUCTION; BIPARTITE GRAPH; LOW-DENSITY PARITY-CHECK (LDPC);

SIGNAL ENCODING;

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

References (29)

1. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
2. C. Di, D. Proietti, I. E. Teletar, T. J. Richardson, and R. L. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
3. D. J. C. MacKay and M. S. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," in Proc. MFCSIT2002, set. Electronic Notes Theoretical Computer Science. Amsterdam, The Netherlands: Elsevier, 2003, vol. 74. Available [Online] at http://www.inference.phy.cam.ac.uk/mackay/abstracts/margulis.htm.
4. T. Richardson, "Error floors of LDPC codes," in Proc. 42nd Allerton Conf. Communication, Control, and Computing, Monticello, IL, 2004, pp. 1426-1435.
5. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
6. G. D. Forney, R. Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," in Proc. IMA Workshop on Codes Systems and Graphical Models, 2001, pp. 101-112.
7. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite length codes," in Proc. 3rd Int. Conf. Turbo Codes and Related Topics, Sep. 2003, pp. 75-82.
8. M. E. O'Sullivan, J. Brevik, and R. Wolski, "The performance of LDPC codes with large girth," in Proc. 43rd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 2005, to be published.
9. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. ICSTA 2001, Ambleside, U.K., 2001.
10. R. M. Tanner, D. Sridhara, A. Sridharan, T. Fuja, and D. Costello, "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 2966-2984, Dec. 2004.
11. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes, Brest, France, 2000, pp. 543-546.
12. T. Mittelholzer, "Efficient encoding and minimum distance bounds of Reed-Solomon type array codes," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 282.
13. K. Yang and T. Helleseth, "On the minimum distance of array codes as LDPC codes," IEEE Trans. Inf. Theory, vol. 49, no. 12, pp. 3268-3271, Dec. 2003.
14. D. Leyba, O. Milenkovic, D. Bennett, and N. Kashyap, "New partition-regular sequences and array codes of large girth," in Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, 2004.
15. M. P. C. Fossorier, "Quasicyclic, low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
16. J. Bond, S. Hui, and H. Schmidt, "Linear-congruence construction of low-density parity-check codes," in Codes, Systems and Graphical Models. sec IMA, B. Marcus and J. Rosenthal, Eds. Berlin, Germany: Springer-Verlag, 2001, vol. 123, pp. 83-100.
17. M. Greferath, M. E. O'Sullivan, and R. Smarandache, "Construction of good LDPC codes using dilation matrices," in Proc. 2004 IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 237.
18. M. E. O'Sullivan, M. Greferath, and R. Smarandache, "Construction of LDPC codes from affine permutation matrices," in Proc. 40th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 2002, pp. 1159-1167.
19. M. E. O'Sullivan and R. Smarandache, "High, rate short length (3. 3s)-regular LDPC codes of girth 6 and 8," in Proc. IEEE 2003 Int. Symp. Informatuin Theory, Yokohama, Japan, Jun./Jul. 2003, p. 59.
20. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
21. L. Chen, J. Xu, I. Djurdjevic, and S. Lin, "Near-Shannon limit quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., vol. 52, no. 7, pp. 1038-1042, Jul. 2004.
22. 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. Inf. Theory, vol. 50, no. 6, pp. 1269-1279, Jun. 2004.
23. B. Vasic and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1156-1176, Jun. 2004.
24. D. J. C. MacKay and M. Davey, "Evaluation of Gallagher codes for short block length and high rate applications," in Codex, Systems and Graphical Models. ser. IMA Volumes in Mathematics and Its Applications, B. Marcus and J. Rosenthal, Eds. New York: Springer, 2001, vol. 123, pp. 113-130. Available [Online] at http:www.inference.phy.cam. ac.uk/mackay/CodesRegular.html.
25. R. Smarandache and P. O. Vontobel, "On regular quasicyclic LDPC codes from binomials," in Proc. 2004 IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 274.
26. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-639, Feb. 2001.
27. R. M. Tanner, "On graph constructions for LDPC codes by quasicyclic extensions," in Information, Coding and Mathematics, M. Blaum, P. Farrell, and H. C. A. van Tilborg, Eds., Norwell, MA: Kluwer, 2002, pp. 209-219.
28. J. Thorpe, K. Andrews, and S. Dolinar, "Methodologies for designing LDPC codes using protographs and circulants," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 238.
29. R. Neal. (2001) Software for Low Density Parity Check (LDPC) Codes. [Online]. Available: http//www.cs.toronto.edu/radford/ldpc.software.html