1. John Brevik and Michael E. O'Sullivan, The performance of LDPC codes with large girth, Preprint (2005), 13 pages.
  2. Eimear Byrne, Marcus Greferath, and Michael E. O'Sullivan, The linear programming bound for codes over finite Frobenius rings, Des. Codes Cryptogr. 42 (2007), no. 3, 289–301.[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. Michael E. O'Sullivan, Algebraic construction of sparse matrices with large girth, IEEE Trans. Inform. Theory 52 (2006), no. 2, 718–727.[MR/link]