On resolvable designs. - Haim Hanani; Dwijendra K. Ray-Chaudhuri; Richard M. Wilson 001 (Discret. Math., 1972)

An Existence Theory for Pairwise Balanced Designs I. Composition Theorems and Morphisms. - Richard M. Wilson 001 (J. Comb. Theory A, 1972)

An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures. - Richard M. Wilson 001 (J. Comb. Theory A, 1972)

Embeddings of Steiner triple systems. - Jean Doyen; Richard M. Wilson 001 (Discret. Math., 1973)

Concerning the number of mutually orthogonal latin squares. - Richard M. Wilson 001 (Discret. Math., 1974)

An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures. - Richard M. Wilson 001 (J. Comb. Theory A, 1975)

Intersection theorems with geometric consequences. - Peter Frankl; Richard M. Wilson 001 (Comb., 1981)

Inequalities for t Designs. - Richard M. Wilson 001 (J. Comb. Theory A, 1983)

On the Preparata and Goethals codes. - Ronald D. Baker; Jacobus H. van Lint; Richard M. Wilson 001 (IEEE Trans. Inf. Theory, 1983)

The exact bound in the Erdös - Ko - Rado theorem. - Richard M. Wilson 001 (Comb., 1984)

On 2-Designs. - Paul Erdös; Joel C. Fowler; Vera T. Sós; Richard M. Wilson 001 (J. Comb. Theory A, 1985)

The Erdös-Ko-Rado theorem for vector spaces. - Peter Frankl; Richard M. Wilson 001 (J. Comb. Theory A, 1986)

On the minimum distance of cyclic codes. - Jacobus H. van Lint; Richard M. Wilson 001 (IEEE Trans. Inf. Theory, 1986)

Binary cyclic codes generated by mira7. - Jacobus H. van Lint; Richard M. Wilson 001 (IEEE Trans. Inf. Theory, 1986)

The number of submatrices of a given type in a Hadamard matrix and related results. - Peter Frankl; Vojtech Rödl; Richard M. Wilson 001 (J. Comb. Theory B, 1988)

Quasi-random graphs. - Fan R. K. Chung; Ronald L. Graham; Richard M. Wilson 001 (Comb., 1989)

Short codes with a given coveting radius. - Richard A. Brualdi; Vera Pless; Richard M. Wilson 001 (IEEE Trans. Inf. Theory, 1989)

A Diagonal Form for the Incidence Matrices of t-Subsets vs.k-Subsets. - Richard M. Wilson 001 (Eur. J. Comb., 1990)

Four Pairwise Balanced Designs. - Esther R. Lamken; W. H. Mills; Richard M. Wilson 001 (Des. Codes Cryptogr., 1991)

A course in combinatorics. - Jacobus H. van Lint; Richard M. Wilson 001 (Cambridge University Press, 1992)

Hyperplane Sections of Fermat Varieties in P3 in Char.2 and Some Applications to Cyclic Codes. - Heeralal Janwa; Richard M. Wilson 001 (AAECC, 1993)

Constructions of Hadamard Difference Sets. - Richard M. Wilson 001; Qing Xiang (J. Comb. Theory A, 1997)

Signed Hypergraph Designs and Diagonal Forms for Some Incidence Matrices. - Richard M. Wilson 001 (Des. Codes Cryptogr., 1999)

Decompositions of Edge-Colored Complete Graphs. - Esther R. Lamken; Richard M. Wilson 001 (J. Comb. Theory A, 2000)

A lemma on polynomials modulo pm and applications to coding theory. - Richard M. Wilson 001 (Discret. Math., 2006)

Set Systems with No Singleton Intersection. - Peter Keevash; Dhruv Mubayi; Richard M. Wilson 001 (SIAM J. Discret. Math., 2006)

The cone condition and t-designs. - Peter Dukes; Richard M. Wilson 001 (Eur. J. Comb., 2007)

More on decompositions of edge-colored complete graphs. - Anna Draganova; Yukiyasu Mutoh; Richard M. Wilson 001 (Discret. Math., 2008)

On set systems with restricted intersections modulo p and p-ary t-designs. - Richard M. Wilson 001 (Discret. Math., 2009)

Diagonal forms for incidence matrices and zero-sum Ramsey theory. - Richard M. Wilson 001; Tony W. H. Wong (Electron. Notes Discret. Math., 2011)

Codes and modules associated with designs and t-uniform hypergraphs. - Richard M. Wilson 001 (Information Security, Coding Theory and Related Combinatorics, 2011)

Covering and packing for pairs. - Yeow Meng Chee; Charles J. Colbourn; Alan C. H. Ling; Richard M. Wilson 001 (J. Comb. Theory A, 2013)

Diagonal forms of incidence matrices associated with tt-uniform hypergraphs. - Richard M. Wilson 001; Tony W. H. Wong (Eur. J. Comb., 2014)