Coding Theory

Low-Density Parity Check Codes

  1. John Brevik and Michael E. O'Sullivan, The performance of LDPC codes with large girth, Preprint (2005), 13 pages.
  2. Sean V. Droms, Keith E. Mellinger, and Chris Meyer, LDPC codes generated by conics in the classical projective plane, Des. Codes Cryptogr. 40 (2006), no. 3, 343–356.[MR]
  3. M. Greferath, M. O'Sullivan, and R. Smarandache, Construction of good LDPC codes using dilation matrices, in Proc. IEEE Intern. Symp. on Inform. Theory, 2004.
  4. Sarah J. Johnson and Steven R. Weller, High-rate LDPC codes from unital designs, IEEE Global Telecommunications Conference 4 (2003), no. 5, 2036– 2040.
  5. Christine A. Kelley, Deepak Sridhara, and Joachim Rosenthal, Tree-based construction of LDPC codes having good pseudocodeword weights, IEEE Trans. Inform. Theory 53 (2007), no. 4, 1460–1478.[MR]
  6. Jon-Lark Kim, Uri N. Peled, Irina Perepelitsa, and Vera Pless, Explicit construction of families of LDPC codes with girth at least six, Proceedings of the Annual Allerton Conference on Communication, Control and Computing, vol. 40, Part 2, 2002, pp. 1024–1031.
  7. Jon-Lark Kim, Uri N. Peled, Irina Perepelitsa, Vera Pless, and Shmuel Friedland, Explicit construction of families of LDPC codes with no 4-cycles, IEEE Trans. Inform. Theory 50 (2004), no. 10, 2378–2388.[MR]
  8. Sunghwan Kim, Jong-Seon No, Habong Chung, and Dong-Joon Shin, Cycle analysis and construction of protographs for QC (LDPC) codes with girth larger than 12, IEEE International Symposium on Information Theory, 2007. ISIT 2007 (2007), 2256-2260.[doi]
  9. Paul F. Kubwalo and John A. Ryan, Low density parity check irreducible Goppa codes, AFRICON 2007 (2007), 8 pages.[doi]
  10. G. Malema, Constructing quasi-cyclic LDPC codes using a search algorithm, 2007 IEEE International Symposium on Signal Processing and Information Technology (2007), 956-960.[doi]
  11. Keith E. Mellinger, LDPC codes from triangle-free line sets, Des. Codes Cryptogr. 32 (2004), no. 1-3, 341–350.[MR]
  12. Arvind Sridharan, Design and analysis of LDPC convolutional codes, PhD Thesis, University of Notre Dame, 2005.
  13. R. Michael Tanner, Deepak Sridhara, Arvind Sridharan, Thomas E. Fuja, and Daniel J. Costello, Jr., LDPC block and convolutional codes based on circulant matrices, IEEE Trans. Inform. Theory 50 (2004), no. 12, 2966–2984.[MR]
  14. Steven R. Weller and Sarah J. Johnson, Iterative decoding of codes from oval designs, Defence Applications of Signal Processing, 2001 Workshop (2001), 1-19.
  15. Steven R. Weller and Sarah J. Johnson, Regular low-density parity-check codes from oval designs, European Transactions on Telecommunications 14 (2003), no. 5, 399-409.