1. E. F. Assmus, Jr. and J. D. Key, Arcs and ovals in the Hermitian and Ree unitals, European J. Combin. 10 (1989), no. 4, 297–308.[MR]
  2. E. F. Assmus, Jr. and J. D. Key, Affine and projective planes, Discrete Math. 83 (1990), no. 2-3, 161–187.[MR]
  3. E. F. Assmus, Jr. and J. D. Key, Baer subplanes, ovals and unitals, Coding Theory and Design Theory, Part I, IMA Vol. Math. Appl., vol. 20, Springer, New York, 1990, pp. 1–8.[MR]
  4. E. F. Assmus, Jr. and J. D. Key, Translation planes and derivation sets, J. Geom. 37 (1990), no. 1-2, 3–16.[MR]
  5. E. F. Assmus, Jr. and J. D. Key, Correction: "Translation planes and derivation sets", J. Geom. 40 (1991), no. 1-2, 198.[MR]
  6. E. F. Assmus, Jr. and J. D. Key, Hadamard matrices and their designs: A coding-theoretic approach, Trans. Amer. Math. Soc. 330 (1992), no. 1, 269–293.[MR]
  7. E. F. Assmus, Jr. and J. D. Key, Designs and codes: an update, Des. Codes Cryptogr. 9 (1996), no. 1, 7–27.[MR]
  8. E. F. Assmus, Jr. and J. D. Key, Polynomial codes and finite geometries, Handbook of Coding Theory, Vol. I, II, North-Holland, Amsterdam, 1998, pp. 1269–1343.[MR]
  9. Neil J. Calkin, Jennifer D. Key, and Marialuisa J. de Resmini, Minimum weight and dimension formulas for some geometric codes, Des. Codes Cryptogr. 17 (1999), no. 1-3, 105–120.[MR]
  10. L. L. Carpenter and J. D. Key, On Hadamard matrices from resolvable Steiner designs, in Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), vol. 108, 1995, pp. 53–63.[MR]
  11. L. L. Carpenter and J. D. Key, Reed-Muller codes and Hadamard designs from ovals, J. Combin. Math. Combin. Comput. 22 (1996), 79–85.[MR]
  12. K. L. Clark and J. D. Key, Geometric codes over fields of odd prime power order, in Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (Boca Raton, FL, 1999), vol. 137, 1999, pp. 177–186.[MR]
  13. K. L. Clark, J. D. Key, and M. J. de Resmini, Dual codes of translation planes, European J. Combin. 23 (2002), no. 5, 529–538.[MR]
  14. Peng Ding and Jennifer D. Key, Minimum-weight codewords as generators of generalized Reed-Muller codes, IEEE Trans. Inform. Theory 46 (2000), no. 6, 2152–2158.[MR]
  15. Peng Ding and Jennifer D. Key, Subcodes of the projective generalized Reed-Muller codes spanned by minimum-weight vectors, Des. Codes Cryptogr. 26 (2002), no. 1-3, 197–211.[MR]
  16. W. Fish, J. D. Key, and E. Mwambene, Graphs, designs and codes related to the n-cube, Discrete Math. 309 (2009), no. 10, 3255–3269.[MR]
  17. W. Fish, J. D. Key, and E. Mwambene, Binary codes from the line graph of the n-cube, J. Symbolic Comput. 45 (2010), no. 7, 800–812.[MR/doi]
  18. W. Fish, J. D. Key, and E. Mwambene, Codes from incidence matrices and line graphs of Hamming graphs, Discrete Math. 310 (2010), no. 13-14, 1884–1897.[MR/doi]
  19. S. Gao and J. D. Key, Bases of minimum-weight vectors for codes from designs, Finite Fields Appl. 4 (1998), no. 1, 1–15.[MR]
  20. D. Ghinelli, M. J. de Resmini, and J. D. Key, Minimum words of codes from affine planes, J. Geom. 91 (2009), no. 1-2, 43–51.
  21. G. A. Kadir and J. D. Key, The Steiner system S(5,8,24) constructed from dual affine planes, Proc. Roy. Soc. Edinburgh Sect. A 103 (1986), no. 1-2, 147–160.[MR]
  22. J. D. Key, Extendable Steiner designs, Geom. Dedicata 41 (1992), no. 2, 201–205.[MR]
  23. J. D. Key, On a class of 1-designs, European J. Combin. 14 (1993), no. 1, 37–41.[MR]
  24. J. D. Key, Bases for codes of designs from finite geometries, in Proceedings of the Twenty-fifth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1994), vol. 102, 1994, pp. 33–44.[MR]
  25. J. D. Key, Extendable Steiner designs from finite geometries, J. Statist. Plann. Inference 56 (1996), no. 2, 181–186.[MR]
  26. J. D. Key, Codes and finite geometries, in Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998), vol. 131, 1998, pp. 85–99.[MR]
  27. J. D. Key, Some error-correcting codes and their applications, Applied Mathematical Modeling: A Multidisciplinary Approach, Edited by D. R. Shier and K. T. Wallenius, CRC Press, Boca Raton, Fl., 1999.
  28. J. D. Key, Some applications of Magma in designs and codes: Oval designs, Hermitian unitals and generalized Reed-Muller codes, J. Symbolic Comput. 31 (2001), no. 1-2, 37–53.[MR]
  29. J. D. Key, Recent developments in permutation decoding, Not. S. Afr. Math. Soc. 37 (2006), no. 1, 2–13.[MR]
  30. J. D. Key and K. Mackenzie, Ovals in the designs W(2m), Ars Combin. 33 (1992), 113–117.[MR]
  31. J. D. Key and K. Mackenzie-Fleming, Rigidity theorems for a class of affine resolvable designs, J. Combin. Math. Combin. Comput. 35 (2000), 147–160.[MR]
  32. J. D. Key, T. P. McDonough, and V. C. Mavron, Partial permutation decoding for codes from finite planes, European J. Combin. 26 (2005), no. 5, 665–682.[MR]
  33. J. D. Key, T. P. McDonough, and V. C. Mavron, Information sets and partial permutation decoding for codes from finite geometries, Finite Fields Appl. 12 (2006), no. 2, 232–247.[MR]
  34. J. D. Key, T. P. McDonough, and V. C. Mavron, Partial permutation decoding for codes from affine geometry designs, J. Geom. 88 (2008), no. 1-2, 101–109.[MR]
  35. J. D. Key, T. P. McDonough, and V. C. Mavron, An upper bound for the minimum weight of the dual codes of Desarguesian planes, European J. Combin. 30 (2009), no. 1, 220–229.[MR]
  36. J. D. Key and J. Moori, Codes, designs and graphs from the Janko groups J1 and J2, J. Combin. Math. Combin. Comput. 40 (2002), 143–159.[MR]
  37. J. D. Key and J. Moori, Some irreducible codes invariant under the Janko group, J1 or J2, preprint (2008), 20 pages.
  38. J. D. Key, J. Moori, and B. G. Rodrigues, On some designs and codes from primitive representations of some finite simple groups, J. Combin. Math. Combin. Comput. 45 (2003), 3–19.[MR]
  39. J. D. Key, J. Moori, and B. G. Rodrigues, Binary codes from graphs on triples, Discrete Math. 282 (2004), no. 1-3, 171–182.[MR]
  40. J. D. Key, J. Moori, and B. G. Rodrigues, Permutation decoding for the binary codes from triangular graphs, European J. Combin. 25 (2004), no. 1, 113–123.[MR]
  41. J. D. Key, J. Moori, and B. G. Rodrigues, Some binary codes from symplectic geometry of odd characteristic, Util. Math. 67 (2005), 121–128.[MR]
  42. J. D. Key, J. Moori, and B. G. Rodrigues, Partial permutation decoding of some binary codes from graphs on triples, Ars Combin. 91 (2009), 363–371.[MR]
  43. J. D. Key, J. Moori, and B. G. Rodrigues, Ternary codes from graphs on triples, Discrete Math. 309 (2009), no. 14, 4663–4681.[MR/doi]
  44. J. D. Key, J. Moori, and B. G. Rodrigues, Codes associated with triangular graphs, and permutation decoding, International Journal of Information and Coding Theory 1 (2010), no. 3, 334–349 pages.
  45. J. D. Key, B. Novick, and F. E. Sullivan, Binary codes of structures dual to unitals, in Proceedings of the Twenty-eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1997), vol. 123, 1997, pp. 119–124.[MR]
  46. J. D. Key and M. J. de Resmini, Small sets of even type and codewords, J. Geom. 61 (1998), no. 1-2, 83–104.[MR]
  47. J. D. Key and M. J. de Resmini, Ternary dual codes of the planes of order nine, J. Statist. Plann. Inference 95 (2001), no. 1-2, 229–236.[MR]
  48. J. D. Key and N. K. A. Rostom, A characterisation of some finite inversive planes, Ars Combin. 27 (1989), 193–195.[MR]
  49. J. D. Key and P. Seneviratne, Binary codes from rectangular lattice graphs and permutation decoding, European J. Combin. 28 (2007), no. 1, 121–126.[MR]
  50. J. D. Key and P. Seneviratne, Codes from the line graphs of complete multipartite graphs and PD-sets, Discrete Math. 307 (2007), no. 17-18, 2217–2225.[MR]
  51. J. D. Key and P. Seneviratne, Permutation decoding for binary codes from lattice graphs, Discrete Math. 308 (2008), no. 13, 2862–2867.[MR]
  52. J. D. Key and F. D. Shobe, Some transitive Steiner triple systems of Bagchi and Bagchi, J. Statist. Plann. Inference 58 (1997), no. 1, 79–86.[MR]
  53. J. D. Key and F. E. Sullivan, Codes of Steiner triple and quadruple systems, Des. Codes Cryptogr. 3 (1993), no. 2, 117–125.[MR]
  54. J. D. Key and F. E. Sullivan, Steiner triple systems with many affine hyperplanes, in Proceedings of the Twenty-sixth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1995), vol. 107, 1995, pp. 105–112.[MR]
  55. J. D. Key and V. D. Tonchev, Computational results for the known biplanes of order 9, Geometry, Combinatorial Designs and Related Structures (Spetses, 1996), London Math. Soc. Lecture Note Ser., vol. 245, Cambridge Univ. Press, Cambridge, 1997, pp. 113–122.[MR]
  56. Jennifer D. Key and Kirsten Mackenzie, An upper bound for the p-rank of a translation plane, J. Combin. Theory Ser. A 56 (1991), no. 2, 297–302.[MR]
  57. Jennifer D. Key and Johannes Siemons, Closure properties of the special linear groups, Ars Combin. 22 (1986), 107–117.[MR]
  58. Jennifer D. Key and Johannes Siemons, On the k-closure of finite linear groups, Boll. Un. Mat. Ital. B (7) 1 (1987), no. 1, 31–55.[MR]
  59. Jennifer D. Key and Johannes Siemons, Regular sets and geometric groups, Results Math. 11 (1987), no. 1-2, 97–116.[MR]
  60. Jennifer D. Key, Johannes Siemons, and Ascher Wagner, Regular sets on the projective line, J. Geom. 27 (1986), no. 2, 188–194.[MR]