Robert Bailey's papers (and other writings)

Published papers

• On the metric dimension of Grassmann graphs (with Karen Meagher), Discrete Mathematics and Theoretical Computer Science 13:4 (2011), 97–104 (arXiv).
• Generalized covering designs and clique coverings (with Andrea Burgess, Michael Cavers and Karen Meagher), Journal of Combinatorial Designs 19 (2011), 378–406; doi: 10.1002/jcd.20288 (arXiv).
• Uncoverings on graphs and network reliability (with Brett Stevens), Australasian Journal of Combinatorics 50 (2011), 219–231 (arXiv; MR2830112).
• Base size, metric dimension and other invariants of groups and graphs (with Peter Cameron), Bulletin of the London Mathematical Society 43 (2011), 209–242; doi 10.1112/blms/bdq096 (MR2781204).
• Hamiltonian decompositions of complete k-uniform hypergraphs (with Brett Stevens), Discrete Mathematics 310 (2010), 3088–3095; doi: 10.1016/j.disc.2009.03.047 (MR2684077).
  Note: Reference [19] has now appeared: this is M. Meszka and A. Rosa, Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles, Australas. J. Combin 45 (2009), 291–301.
• Error-correcting codes from permutation groups, Discrete Mathematics 309 (2009), 4253–4265; doi: 10.1016/j.disc.2008.12.027 (MR2519160).
• On the single-orbit conjecture for uncoverings-by-bases (with Peter Cameron), Journal of Group Theory 11 (2008), 845–850; doi: 10.1515/JGT.2008.053 (MR2466911).
• Decoding the Mathieu group M₁₂ (with John Bray), Advances in Mathematics of Communications 1 (2007), 477–487; doi: 10.3934/amc.2007.1.477 (MR2354049).
• Distance enumerators for permutation groups (with Jonathan Dixon), Communications in Algebra 35 (2007), 3045–3051; doi: 10.1080/00927870701405017 (MR2356140).
• Uncoverings-by-bases for base-transitive permutation groups, Designs, Codes and Cryptography 41 (2006), 153–176; doi: 10.1007/s10623-006-9005-x (MR2271685).

Accepted

• Generalized packing designs (with Andrea Burgess), to appear in Discrete Mathematics; doi: 10.1016/j.disc.2011.11.039 (arXiv).
• Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns (with Thomas Prellberg), to appear in Contributions to Discrete Mathematics (arXiv).

Coming soon

• On packing spanning trees in graphs and bases in matroids (with Mike Newman and Brett Stevens).
• Resolving sets in Johnson and Kneser graphs (with José Cáceres, Delia Garijo, Antonio González, Alberto Márquez, Karen Meagher and Maria Luz Puertas).
• On the metric dimension of the incidence graph of a finite projective space (with Bill Martin).
• Separation defects and bases.

Ph.D. Thesis

• Permutation groups, error-correcting codes and uncoverings, submitted 7th November 2005.

Other writings

• My M.Math. project entitled Distance-transitive graphs, from May 2002. This comes with a health warning, as some of the proofs are not as correct as they ought to be, so don't take them for granted....
• Notes on distance-transitive (and distance regular) graphs, based on talks given in the Queen Mary Combinatorics Study Group in February/March 2004.
• My (co-winning) Ann Cook Prize entry, Error-correcting codes from permutation groups, from October 2004.
• A family of near-optimal cyclic uncoverings.
  This was rejected after the referee pointed out that the lower bound calculated in this paper was bettered by an earlier result. The construction of uncoverings given here has been incorporated into the subsequent paper on uncoverings-by-bases above.
• Packing spanning trees and the k-tree protocol (with Brett Stevens) (arXiv). After this was rejected, we decided to merge this with another paper dealing with the matroid case.

Page last updated: 8 January 2012

Back to Robert Bailey's homepage