1. 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]
  2. M. van Dijk, S. Egner, M. Greferath, and A. Wassermann, Geometric codes over fields of odd prime power order, in IEEE International Symposium on Information Theory (ISIT), Yokohama, 2003.
  3. M. van Dijk, S. Egner, M. Greferath, and A. Wassermann, On binary linear [160,80,24] codes, in IEEE International Symposium on Information Theory (ISIT), Yokohama, 2003.
  4. Marten van Dijk, Sebastian Egner, Marcus Greferath, and Alfred Wassermann, On two doubly even self-dual binary codes of length 160 and minimum weight 24, IEEE Trans. Inform. Theory 51 (2005), no. 1, 408–411.[MR]
  5. 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.
  6. Marcus Greferath and Emanuele Viterbo, On Z4- and Z9-linear lifts of the Golay codes, IEEE Trans. Inform. Theory 45 (1999), no. 7, 2524–2527.[MR]