On the uniqueness of (q + 1)4-arcs of PG(4, q), Q = 2h, h >=3. - L. Rey A. Casse; David G. Glynn (Discret. Math., 1984)

The non-classical 10-arc of PG(4, 9). - David G. Glynn (Discret. Math., 1986)

Rings of geometries I. - David G. Glynn (J. Comb. Theory A, 1987)

On finite division algebras. - David G. Glynn (J. Comb. Theory A, 1987)

Rings of geometries II. - David G. Glynn (J. Comb. Theory A, 1988)

The construction of self-dual binary codes from projective planes of odd order. - David G. Glynn (Australas. J Comb., 1991)

Groups of generalised projectivities in projective planes of odd order. - David G. Glynn; Günter F. Steinke (Australas. J Comb., 1992)

On Conics that are Ovals in a Hall Plane. - David G. Glynn; Günter F. Steinke (Eur. J. Comb., 1993)

Translation Laguerre Planes of Order 16. - David G. Glynn; Günter F. Steinke (Eur. J. Comb., 1993)

On the construction of arcs using quadrics. - David G. Glynn (Australas. J Comb., 1994)

On the Classification of Geometric Codes by Polynomial Functions. - David G. Glynn; J. W. P. Hirschfeld (Des. Codes Cryptogr., 1995)

On cubic curves in projective planes of characteristic two. - David G. Glynn (Australas. J Comb., 1998)

The representation of any affine plane of prime-power order within its own line-code. - David G. Glynn (Discret. Math., 1999)

On Senary Simplex Codes. - Manish K. Gupta 004; David G. Glynn; T. Aaron Gulliver (AAECC, 2001)

On the Orthogonality of Geometric Codes. - David G. Glynn (Des. Codes Cryptogr., 2004)

The polynomial degree of the Grassmannian G(1, n, q) of lines in finite projective space PG(n, q). - David G. Glynn; Johannes G. Maks; Rey Casse (Des. Codes Cryptogr., 2006)

Linear transformations on codes. - David G. Glynn; T. Aaron Gulliver; Manish K. Gupta 004 (Discret. Math., 2006)

On Some Quaternary Self-Orthogonal Codes. - David G. Glynn; T. Aaron Gulliver; Manish K. Gupta 004 (Ars Comb., 2007)

The permanent of a square matrix. - David G. Glynn (Eur. J. Comb., 2010)

The Conjectures of Alon–Tarsi and Rota in Dimension Prime Minus One. - David G. Glynn (SIAM J. Discret. Math., 2010)

An invariant for matrices and sets of points in prime characteristic. - David G. Glynn (Des. Codes Cryptogr., 2011)

A condition for arcs and MDS codes. - David G. Glynn (Des. Codes Cryptogr., 2011)

The factorization of the permanent of a matrix with minimal rank in prime characteristic. - David G. Glynn (Des. Codes Cryptogr., 2012)

An Invariant for Hypersurfaces in Prime Characteristic. - David G. Glynn (SIAM J. Discret. Math., 2012)

Graphs for Orthogonal Arrays and Projective Planes of Even Order. - David G. Glynn; David Byatt (SIAM J. Discret. Math., 2012)

Permanent formulae from the Veronesean. - David G. Glynn (Des. Codes Cryptogr., 2013)

Nonfactorizable nonsingular hypercubes. - David G. Glynn (Des. Codes Cryptogr., 2013)

Counting generalized Reed-Solomon codes. - Peter Beelen; David G. Glynn; Tom Høholdt; Krishna V. Kaipa (Adv. Math. Commun., 2017)

Multiple Hamilton cycles in bipartite cubic graphs: An algebraic method. - Adel Alahmadi; David G. Glynn (Finite Fields Their Appl., 2017)

Cyber-Security Threats and Side-Channel Attacks for Digital Agriculture. - Adel Alahmadi; Saeed Ur Rehman; Husain S. Alhazmi; David G. Glynn; Hatoon Shoaib; Patrick Solé (Sensors, 2022)